-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathLc_34.java
More file actions
56 lines (42 loc) · 1.26 KB
/
Lc_34.java
File metadata and controls
56 lines (42 loc) · 1.26 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
//Lc- 34. Find First and Last Position of Element in Sorted Array
public class Lc_34 {
public static void main(String[] args) {
int[] nums = new int[]{1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 5};
int[] res = searchRange(nums, 1);
for(int num : res){
System.out.println(num);
}
}
static public int[] searchRange(int[] nums, int target) {
int[] res = new int[]{-1, -1};
res[0] = search(nums, target, true);
if(res[0] != -1){
res[1] = search(nums, target, false);
}
return res;
}
static public int search (int[] nums, int target, boolean firstSearch){
int ans = -1;
int start = 0, end = nums.length-1;
// first occurrence
while(start <= end){
int mid = (start + (end - start)/2);
if(target == nums[mid]){
ans = mid;
if(firstSearch){
end = mid - 1;
}
else{
start = mid + 1;
}
}
else if(target > nums[mid]){
start = mid + 1;
}
else if(target < nums[mid]){
end = mid - 1;
}
}
return ans;
}
}