#include<iostream>
#include<vector>
using namespace std;
class Solution
{
public:
int findindex(vector<int>a,int target)
{
if(a.empty())
return 0;
int first=0,last=a.size()-1;
while(first<last)
{
int mid=first+(last-first)/2;
if(a[mid]==target)
return mid;
else if(a[mid]<target)
first=mid+1;
else
last=mid-1;
}
if(a[first]<target)
return first+1;
else
return first;
}
};
void main()
{
Solution solution;
int a[4]={1,5,8,14};
vector<int>arr(a,a+4);
cout<<solution.findindex(arr,5);
}
[leetcode]Search Insert Position
最新推荐文章于 2019-02-13 15:00:16 发布