题解 | #二分查找-II#
二分查找-II
http://www.nowcoder.com/practice/4f470d1d3b734f8aaf2afb014185b395
简洁的二分代码
class Solution {
public:
int search(vector<int>& nums, int target) {
if(nums.size()==0) return -1;
int l=0,r=nums.size()-1;
while(l<r){
int mid=(l+r)>>1;
if(nums[mid]>=target) r=mid;
else
l=mid+1;
}
if(nums[l]==target) return l;
return -1;
}
};
查看3道真题和解析