给定一个排序数组和一个目标值,在数组中找到目标值,并返回其索引。如果目标值不存在于数组中,返回它将会被按顺序插入的位置。
你可以假设数组中无重复元素。
示例 1:
输入: [1,3,5,6], 5
输出: 2
示例 2:
输入: [1,3,5,6], 2
输出: 1
示例 3:
输入: [1,3,5,6], 7
输出: 4
示例 4:
输入: [1,3,5,6], 0
输出: 0
public class SearchInsertPosition {
public int searchInsert(int[] nums, int target) {
int temp = 0;
if (nums.length == 1) {
if (nums[0] >= target) {
return temp;
} else {
temp++;
return temp;
}
}
for (int i = 0; i < nums.length; i++) {
if (nums[i] == target) {
return i;
} else {
if (target > nums[i]) {
temp++;
} else if (target < nums[i]) {
return i;
}
}
}
return temp;
}
/**
* 二分查找
* @param nums
* @param target
* @return
*/
public int searchInsert1(int[] nums, int target) {
int n = nums.length;
int left = 0, right = n - 1, ans = n;
while (left <= right) {
int mid = ((right - left) >> 1) + left;
if (target <= nums[mid]) {
ans = mid;
right = mid - 1;
} else {
left = mid + 1;
}
}
return ans;
}
public static void main(String[] args) {
SearchInsertPosition search = new SearchInsertPosition();
int[] nums = new int[]{1,3,5,6};
// int[] nums = new int[]{1};
System.out.println(search.searchInsert1(nums, 7));
}
}
Copyright: 采用 知识共享署名4.0 国际许可协议进行许可 Links: https://cloud.tencent.com/developer/article/2020399