-
Notifications
You must be signed in to change notification settings - Fork 0
/
searchInsertPosition.java
52 lines (38 loc) · 1.1 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
// 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.
// Example 1:
// Input: [1,3,5,6], 5
// Output: 2
// Example 2:
// Input: [1,3,5,6], 2
// Output: 1
// Example 3:
// Input: [1,3,5,6], 7
// Output: 4
// Example 4:
// Input: [1,3,5,6], 0
// Output: 0
class Solution {
public int searchInsert(int[] nums, int target) {
int left = 0, right = nums.length -1 , mid = 0;
int order = 0;
if(nums.length == 0){
return -1;
}
while(left <= right){
mid = right + left / 2;
if(nums[mid] == target){
return mid;
} else if (nums[mid] > target){
right = mid - 1;
} else {
left = mid + 1;
}
}
if(nums[mid] > target){
order = mid;
} else if(nums[mid] < target){
order = mid+1;
}
return order; }
}