首页 > 代码库 > Search Insert Position
Search Insert Position
Given a sorted array of integers, find the starting and ending position of a given target value.
Your algorithm‘s runtime complexity must be in the order of O(log n).
If the target is not found in the array, return [-1, -1].
For example,
Given [5, 7, 7, 8, 8, 10] and target value 8,
return [3, 4].
class Solution {public: int bsearch(int a[],int left,int right,int key){ if(left>right) return left; int mid=left+(right-left)/2; if(a[mid]==key) return mid; else if(a[mid]<key) return bsearch(a,mid+1,right,key); else return bsearch(a,left,mid-1,key); } int searchInsert(int A[], int n, int target) { return bsearch(A,0,n-1,target); }};
Search Insert Position
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。