704. 二分查找
给定一个 n 个元素有序的(升序)整型数组 nums 和一个目标值 target ,写一个函数搜索 nums 中的 target,如果目标值存在返回下标,否则返回 -1。
class Solution {
public int search(int[] nums, int target) {
int low=0,high=nums.length-1;
int mid = (low+high)/2;
while(low<=high){
if(nums[mid]<target){
low = mid+1;
mid = (low +high)/2;
}else if(nums[mid]>target){
high=mid -1;
mid = (low +high)/2;
}else{
return mid;
}
}
return -1;
}
}