顿搜
飞过闲红千叶，夕岸在哪
类目归类
[LeetCode 35] Search Insert Position [Java]
12/22
1. Description
Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.
You may assume no duplicates in the array.
2. Example
[tabby title="Example 1"]
Input: [1,3,5,6], 5
Output: 2
[tabby title="Example 2"]
Input: [1,3,5,6], 2
Output: 1
[tabby title="Example 3"]
Input: [1,3,5,6], 7
Output: 4
[tabby title="Example 4"]
Input: [1,3,5,6], 0
Output: 0
[tabbyending]
3. Code
public class LeetCode0035 {
public int searchInsert(int[] nums, int target) {
if (nums == null || nums.length == 0) {
return -1;
}
int i = 0, j = nums.length;
while (i < j) {
int mid = i + ((j - i) >> 1);
if (nums[mid] < target) {
i = mid + 1;
} else {
j = mid;
}
}
return j;
}
public static void main(String[] args) {
LeetCode0035 leetcode = new LeetCode0035();
int[] nums = new int[] { 1, 3, 5, 6 };
System.out.println(leetcode.searchInsert(nums, 0));
}
}
