Repository navigation
Expand file tree
/
Copy pathSearchforaRange.java
More file actions
88 lines (72 loc) · 1.55 KB
/
Copy pathSearchforaRange.java
File metadata and controls
88 lines (72 loc) · 1.55 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
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
package leetcode;
public class SearchforaRange {
public int[] searchRange(int[] nums, int target) {
int[] range = new int[2];
if (nums.length == 0) {
range[0] = -1;
range[1] = -1;
return range;
}
int index = binarySearch(0, nums.length - 1, nums, target);
if (index == -1) {
range[0] = -1;
range[1] = -1;
} else {
int start = 0;
for (start = index - 1; start >= 0; start--) {
if (nums[start] != target) {
break;
}
}
if (start == 0 && nums[start] == target) {
range[0] = 0;
} else {
range[0] = start + 1;
}
int end = 0;
for (end = index + 1; end < nums.length; end++) {
if (nums[end] != target) {
break;
}
}
if (end == nums.length - 1 && nums[end] == target) {
range[1] = end;
} else {
range[1] = end - 1;
}
}
return range;
}
int binarySearch(int start, int end, int[] nums, int target) {
if (nums[start] == target) {
return start;
}
if (nums[end] == target) {
return end;
}
if (nums[start] < target && nums[end] > target) {
if (end - start < 10) {
for (int i = start + 1; i < end; i++) {
if (nums[i] == target) {
return i;
}
}
} else {
int index = -1;
index = binarySearch(start + 1, (start + end) / 2, nums, target);
if (index != -1) {
return index;
}
index = binarySearch((start + end) / 2 + 1, end - 1, nums,
target);
if (index != -1) {
return index;
}
}
}
return -1;
}
public static void main(String[] args) {
// TODO Auto-generated method stub
}
}