-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathSolution.java
More file actions
36 lines (35 loc) · 926 Bytes
/
Solution.java
File metadata and controls
36 lines (35 loc) · 926 Bytes
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
package leetcode._34_;
class Solution {
public int[] searchRange(int[] nums, int target) {
int[] result = new int[]{-1, -1};
if (nums.length == 0) {
return result;
}
int i = 0;
int j = nums.length - 1;
while (i < j) {
int mid = (i + j) / 2;
if (nums[mid] < target) {
i = mid + 1;
} else {
j = mid;
}
}
if (nums[i] != target)
return result;
result[0] = i;
j = nums.length - 1;
while (i < j) {
int mid = (i + j) / 2 + 1; // 中位数偏右，避免上面的判断无法跳出循环
if (nums[mid] > target) {
j = mid - 1;
} else {
i = mid;
}
}
if (nums[j] == target) {
result[1] = j;
}
return result;
}
}