找到了就return mid
找不到return -1
class Solution {
public:
int search(vector<int>& nums, int target) {
int n=nums.size();
if(n==0){
return -1;
}
int l=0,r=n-1;
while(l<=r){
int mid=(l+r)/2;
if(nums[mid]==target) return mid;
if(nums[mid]<target){
l=mid+1;
}
if(nums[mid]>target){
r=mid-1;
}
}
return -1;
}
};