lintcode-搜索区间-61

[-1, -1]

[5, 7, 7, 8, 8, 10]

8

[3, 4]

class Solution {

public:

int LowerBound(vector<int> &A,int target){
int y=A.size();
int x=0;
while(x<y){
int mid=x+(y-x)/2;
if(target>A[mid])
x=mid+1;
else
y=mid;
}
return x;
}
vector<int> searchRange(vector<int> &A, int target) {
vector<int> v(2,-1);
if(A.empty())
return v;
bool f=false;
int  i=LowerBound(A,target);
int  end=i;

while(A[end]==target){
++end;
f=true;
}
if(f){
v[0]=i;
v[1]=end-1;
}
return v;
}
};