problem
704. Binary Search
solution:
class Solution {
public:
int search(vector<int>& nums, int target) {
int left = 0, right = nums.size()-1, mid = 0;
while(left<=right)//errr...
{
mid = left + (right-left)/2;
if(nums[mid]<target) left = mid+1;
else if(nums[mid]>target) right = mid-1;
else return mid;
}
return -1;
}
};
参考
1. Leetcode_easy_704. Binary Search;
完