forked from DengWangBao/Leetcode-Java
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathSearchForARange.java
More file actions
84 lines (73 loc) · 2 KB
/
SearchForARange.java
File metadata and controls
84 lines (73 loc) · 2 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
public class SearchForARange {
/**
* TestCase
* [1], 0
* [1], 1
*/
public int[] searchRange(int[] nums, int target) {
if (nums.length == 0) {
return new int[]{-1, -1};
}
int first = firstHigherEqual(nums, target);
if (first == nums.length || nums[first] != target) {
return new int[] {
-1, -1
};
}
return new int[] {
first,
firstHigherEqual(nums, target + 1) - 1
};
}
private int firstHigherEqual(int[] nums, int target) {
int left = 0, right = nums.length;
while (left < right) {
int mid = (left + right) / 2;
if (nums[mid] < target) {
left = mid + 1;
} else {
right = mid;
}
}
return left;
}
public int[] searchRange2(int[] nums, int target) {
if (nums.length == 0) {
return new int[]{-1, -1};
}
return new int[] {
lowerBound(nums, target),
upperBound(nums, target)
};
}
/**
* lowerBound和upperBound的TestCase
* [1,3],3
* [1,3],1
* [2,2],2
*/
public static int lowerBound(int[] nums, int target) {
int left = 0, right = nums.length - 1;
while (left < right) {
int mid = left + ((right - left) >> 1);
if (target > nums[mid]) {
left = mid + 1;
} else {
right = mid;
}
}
return nums[left] == target ? left : -1;
}
public static int upperBound(int[] nums, int target) {
int left = 0, right = nums.length - 1;
while (left < right) {
int mid = left + ((right - left) >> 1) + 1;
if (target < nums[mid]) {
right = mid - 1;
} else {
left = mid;
}
}
return nums[right] == target ? right : -1;
}
}