-
Notifications
You must be signed in to change notification settings - Fork 2
/
SearchInsertPosition.java
66 lines (61 loc) · 1.78 KB
/
SearchInsertPosition.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
package Leetcode;
/**
* @author kalpak
*
* Given a sorted array of distinct integers 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.
*
* Example 1:
* Input: nums = [1,3,5,6], target = 5
* Output: 2
*
* Example 2:
* Input: nums = [1,3,5,6], target = 2
* Output: 1
*
* Example 3:
* Input: nums = [1,3,5,6], target = 7
* Output: 4
*
* Example 4:
* Input: nums = [1,3,5,6], target = 0
* Output: 0
*
* Example 5:
* Input: nums = [1], target = 0
* Output: 0
*
* Constraints:
*
* 1 <= nums.length <= 10^4
* -10^4 <= nums[i] <= 10^4
* nums contains distinct values sorted in ascending order.
* -10^4 <= target <= 10^4
*/
public class SearchInsertPosition {
public static int searchInsert(int[] nums, int target) {
int left = 0;
int right = nums.length - 1;
int result = 0;
while (left <= right) {
int mid = left + (right - left)/2;
if(nums[mid] == target) {
return mid;
}
else if (nums[mid] < target) { // target is greater
left = mid + 1;
} else if (nums[mid] > target) { // target is smaller
right = mid - 1;
result = mid; // cache the result. Can be a candidate for ceiling.
}
}
return (left >= nums.length) ? left : result; // Return left, if number to be entered is at the end of the array
}
public static void main(String[] args) {
int[] nums = new int[]{1, 3, 5, 6};
System.out.println(searchInsert(nums, 5));
System.out.println(searchInsert(nums, 2));
System.out.println(searchInsert(nums, 7));
System.out.println(searchInsert(nums, 0));
}
}