Repository navigation
Expand file tree
/
Copy path_34.java
More file actions
64 lines (57 loc) · 1.87 KB
/
Copy path_34.java
File metadata and controls
64 lines (57 loc) · 1.87 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
package com.fishercoder.solutions;
import com.fishercoder.common.utils.CommonUtils;
/**Given an array of integers sorted in ascending order, find the starting and ending position of a given target value.
Your algorithm's runtime complexity must be in the order of O(log n).
If the target is not found in the array, return [-1, -1].
For example,
Given [5, 7, 7, 8, 8, 10] and target value 8,
return [3, 4].
*/
public class _34 {
public static int[] searchRange(int[] nums, int target) {
int start = 0, end = nums.length-1;
int[] range = new int[2];
range[0] = -1; range[1] = -1;
while(start+1 < end){
int mid = start + (end-start)/2;
if(nums[mid] == target) {
int left = mid;
while(left-1 >= 0 && nums[left] == nums[left-1]){
left--;
}
range[0] = left;
int right = mid;
while(right+1< nums.length && nums[right] == nums[right+1]){
right++;
}
range[1] = right;
break;
} else if(nums[mid] < target){
start = mid;
} else {
end = mid;
}
}
if(nums[start] == target){
range[0] = start;
while(start+1 < nums.length && nums[start] == nums[start+1]){
start++;
}
range[1] = start;
}
if(nums[end] == target){
range[1] = end;
while(end-1 >= 0 && nums[end] == nums[end-1]){
end--;
}
range[0] = end;
}
return range;
}
public static void main(String...strings){
int[] nums = new int[]{1,2,3};
int target = 2;
int[] result = searchRange(nums, target);
CommonUtils.printArray(result);
}
}