-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathfnlindexofelemnt.java
More file actions
47 lines (43 loc) · 1.52 KB
/
fnlindexofelemnt.java
File metadata and controls
47 lines (43 loc) · 1.52 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
public class fnlindexofelemnt {
public static void main(String[] args) {
int nums[]={5,7,7,7,7,8,8,10};
int target= 7;
int[] result = searchRange(nums, target);
System.out.println("First occurrence: " + result[0]);
System.out.println("Last occurrence: " + result[1]);
}
public static int[] searchRange(int[] nums, int target) {
int[] ans = {-1, -1};
// check for first occurrence if target first
ans[0] = search(nums, target, true);
if (ans[0] != -1) {
ans[1] = search(nums, target, false);
}
return ans;
}
// this function just returns the index value of target
static int search(int[] nums, int target, boolean findStartIndex) {
int ans = -1;
int start = 0;
int end = nums.length - 1;
while(start <= end) {
// find the middle element
// int mid = (start + end) / 2; // might be possible that (start + end) exceeds the range of int in java
int mid = start + (end - start) / 2;
if (target < nums[mid]) {
end = mid - 1;
} else if (target > nums[mid]) {
start = mid + 1;
} else {
// potential ans found
ans = mid;
if (findStartIndex) {
end = mid - 1;
} else {
start = mid + 1;
}
}
}
return ans;
}
}