输入:[-1,0,3,4,6,10,13,14],13
输出:6(不存在时返回-1)
public int search (int[] nums, int target) {
// write code here
int l = 0;
int r = nums.length-1;
while(l <= r){
int mid =(l+r)/2;
if(nums[mid]==target){
return mid;
}
if(nums[mid]>target){
r = mid - 1;
}else{
l = mid + 1;
}
}
return 0;
}