-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path0035_search_insert_position.java
More file actions
85 lines (74 loc) · 1.96 KB
/
0035_search_insert_position.java
File metadata and controls
85 lines (74 loc) · 1.96 KB
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
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
/*
给定一个排序数组和一个目标值，在数组中找到目标值，并返回其索引。如果目标值不存在于数组中，返回它将会被按顺序插入的位置。
你可以假设数组中无重复元素。
示例 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
*/
class MySolution {
public int searchInsert(int[] nums, int target) {
int left = 0, right = nums.length-1;
int mid = -1;
while (left <= right) {
mid = left + (right - left) / 2;
if (nums[mid] > target)
right = mid - 1;
else if (nums[mid] < target)
left = mid + 1;
else
break;
}
if (nums[mid] < target) mid++;
return mid;
}
}
class Solution1 {
public int searchInsert(int[] nums, int target) {
int min = 0;
int max = nums.length-1;
int result
5402
= 0;
while (max > min) {
int a = min + ((max - min) >> 1);
if (nums[a] == target) {
return a;
} else if (nums[a] < target) {
min = a + 1;
result = min;
} else if (nums[a] > target) {
max = a;
result = max;
}
}
if (nums[result] < target) {
result++;
}
return result;
}
}
class Solution2 {
public int searchInsert(int[] nums, int target) {
int left = 0;
int right = nums.length ;
while(left < right){
int middle = left + (right - left) / 2;
if (nums[middle] == target) {
return middle;
}
if (nums[middle] > target) {
right = middle;
} else{
left = middle + 1;
}
}
return left;
}
}