给定一个 n 个元素有序的(升序)整型数组 nums 和一个目标值 target ,写一个函数搜索 nums 中的 target,如果目标值存在返回下标,否则返回 -1。
输入: nums = [-1,0,3,5,9,12], target = 9
输出: 4
输入: nums = [-1,0,3,5,9,12], target = 2
输出: -1
使用二分法
class Solution {
public int search(int[] nums, int target) {
int a = nums.length;
int low = 0;
int high = a-1;
int b = -1;
while(low <= high){
int mid = (low + high)/2;
if (target == nums[mid]){
b = mid;
break;
}else if (nums[mid]>target){
high = mid - 1;
}else if (nums[mid]<target){
low = mid + 1;
}
}
return b;
}
}