-
Notifications
You must be signed in to change notification settings - Fork 0
/
Solution.java
52 lines (46 loc) · 1.26 KB
/
Solution.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
package searchinsertposition;
/**
* 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.
* <p>
* You may assume no duplicates in the array.
* <p>
* Example 1:
* <p>
* Input: [1,3,5,6], 5
* Output: 2
* Example 2:
* <p>
* Input: [1,3,5,6], 2
* Output: 1
* Example 3:
* <p>
* Input: [1,3,5,6], 7
* Output: 4
* Example 4:
* <p>
* Input: [1,3,5,6], 0
* Output: 0
*/
class Solution {
public int searchInsert(int[] nums, int target) {
return recBinSearch(nums, 0, nums.length - 1, target);
}
private int recBinSearch(int[] nums, int low, int high, int target) {
int mid = (low + high) / 2;
if (nums[mid] == target) {
return mid;
}
if (low > high) {
return low;
} else if (target < nums[mid]) {
return recBinSearch(nums, low, mid - 1, target);
} else if (target > nums[mid]) {
return recBinSearch(nums, mid + 1, high, target);
}
return -1;
}
}
/*
Runtime: 0 ms, faster than 100.00% of Java online submissions for Search Insert Position.
Memory Usage: 40.9 MB, less than 5.41% of Java online submissions for Search Insert Position.
*/