原汁原味的二分查找
class Solution {
public int search(int[] nums, int target) {
int l = 0,r = nums.length - 1;
while(l <= r){
int mid = (l + r) >> 1;
if(nums[mid] == target){
return mid;
}else if(nums[mid] > target){
r = mid - 1;
}else{
l = mid + 1;
}
}
return -1;
}
}