-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathSolution.java
More file actions
73 lines (68 loc) · 2.01 KB
/
Solution.java
File metadata and controls
73 lines (68 loc) · 2.01 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
65
66
67
68
69
70
71
72
73
package leetCode_34;
/**
* @author dimdark
*/
public class Solution {
public int findFirstIndexOfEqualElement(int[] numbers, int target) {
if (numbers == null || numbers.length == 0) {
return -1;
}
int low = 0;
int high = numbers.length - 1;
int mid;
while (low <= high) {
mid = low + ((high - low) >> 1);
if (numbers[mid] == target) {
high = mid;
if (low == high) {
break;
}
} else if (numbers[mid] > target) {
high = mid - 1;
} else {
low = mid + 1;
}
}
return (low == high) ? low : -1;
}
public int findLastIndexOfEqualElement(int[] numbers, int target) {
if (numbers == null || numbers.length == 0) {
return -1;
}
int low = 0;
int high = numbers.length - 1;
int mid;
while (low <= high) {
mid = low + ((high - low) >> 1);
if (numbers[mid] == target) {
low = mid;
if (low == high) {
break;
}
if (low + 1 == high) {
if (numbers[low] == numbers[high]) {
low = high;
} else {
high = low;
}
break;
}
} else if (numbers[mid] < target) {
low = mid + 1;
} else {
high = mid - 1;
}
}
return (low == high) ? low : -1;
}
public int[] searchRange(int[] numbers, int target) {
int[] results = new int[2];
results[0] = results[1] = -1;
if (numbers == null || numbers.length == 0) {
return results;
}
results[0] = findFirstIndexOfEqualElement(numbers, target);
results[1] = findLastIndexOfEqualElement(numbers, target);
return results;
}
}