题目描述:
示例 1:
示例 2:
输入: nums = [-1,0,3,5,9,12], target = 2
输出: -1
解释: 2 不存在 nums 中因此返回 -1
题目描述:
- 使用二分法搜索值
思路:
二分法解就可以了
代码实现:
class Solution {
public int search(int[] nums, int target) {
int left = 0, right = nums.length - 1;
int middle = (left + right) / 2;
while (left <= right) {
if (nums[middle] < target) {
left = middle + 1;
} else if (nums[middle] > target){
right = middle - 1;
} else {
return middle;
}
middle = (left + right) / 2;
}
return -1;
}
}