leetcode 704. 二分查找 easy
题目描述:
解题思路:
练二分模板的套路题
代码:
//
class Solution {
public:
int search(vector<int>& nums, int target) {
if (nums.empty())
return -1;
int l = 0, r = nums.size()-1;
while(l<r){
int mid = l+(r-l)/2;
if (nums[mid] >= target)
r = mid;
else
l = mid + 1;
}
return nums[l] == target? l:-1;
}
};