704
二分查找,不知道为什么超时
class Solution {
public int search(int[] nums, int target) {
int left = 0;
int right=nums.length-1;
int mid = (right-left)/2+left;
while(left<=right){
if(nums[mid]>target){
right = mid-1;
}else if(nums[mid]<target){
left=mid+1;
}else if(nums[mid]==target){
return mid;
}
}
return -1;
}
}