-
Notifications
You must be signed in to change notification settings - Fork 31
/
34.java
41 lines (38 loc) · 1.09 KB
/
34.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
class Solution {
public int[] searchRange(int[] nums, int target) {
int[] res = new int[2];
res[0] = findFirst(nums, target);
res[1] = findLast(nums, target);
return res;
}
private int findFirst(int[] nums, int target){
int index = -1, low = 0, high = nums.length - 1;
while(low <= high){
int mid = (low + high) / 2;
if(nums[mid] >= target){
high = mid - 1;
}else{
low = mid + 1;
}
if(nums[mid] == target){
index = mid;
}
}
return index;
}
private int findLast(int[] nums, int target){
int index = -1, low = 0, high = nums.length - 1;
while(low <= high){
int mid = (low + high) / 2;
if(nums[mid] <= target){
low = mid + 1;
}else{
high = mid - 1;
}
if(nums[mid] == target){
index = mid;
}
}
return index;
}
}