二分查找
class Solution {
public int search(int[] nums, int target) {
int left = 0, right = nums.length - 1;
while (left <= right) {
int mid = left + (right - left) / 2;
if (nums[mid] > target) {
right--;
} else if (nums[mid] < target) {
left++;
} else {
return mid;
}
}
return -1;
}
}
插入元素
class Solution {
public int searchInsert(int[] nums, int target) {
int left = 0, right = nums.length - 1;
while (left <= right) {
int mid = left + (right - left) / 2;
if (nums[mid] < target) {
left++;
} else if (nums[mid] > target) {
right--;
} else {
return mid;
}
}
return left;
}
}