class Solution {
public int search(int[] nums, int target) {
// 目标值的下标
int index = 0;
// 左右边界
int left = 0;
int right = nums.length - 1;
// 注意是小于等于
while (left <= right) {
index = left + (right - left) / 2;
if (nums[index] == target)
return index;
else if (nums[index] > target)
right = index - 1;
else
left = index + 1;
}
// 没找到
return -1;
}
}
3.2 Kotlin
class Solution {
fun search(nums: IntArray, target: Int): Int {
// 目标值的下标
var index = 0
// 左右边界
var left = 0
var right = nums.size - 1
// 注意是小于等于
while (left <= right) {
index = left + (right - left) / 2
if (nums[index] == target)
return index
else if (nums[index] > target)
right = index - 1
else
left = index + 1
}
// 没找到
return -1
}
}