-
-
Notifications
You must be signed in to change notification settings - Fork 299
/
34.java
177 lines (158 loc) · 5.26 KB
/
34.java
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
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
_________________________________________________________________________________________________
0ms
class Solution {
public int[] searchRange(int[] nums, int target) {
if(nums.length == 0) return new int[]{-1, -1};
int start = binarySearch(nums, target, 0, nums.length-1);
int end = start;
while(start != -1){
int tempStart = binarySearch(nums, target, 0, start - 1);
if(tempStart == -1) break;
start = tempStart;
}
while(end != -1){
int tempEnd = binarySearch(nums, target, end + 1, nums.length-1);
if(tempEnd == -1) break;
end = tempEnd;
}
return new int[]{start, end};
}
private int binarySearch(int[] nums, int target, int min, int max){
int start = min;
int end = max;
if(start <= end){
int middle = (start + end) / 2;
int midValue = nums[middle];
if(midValue == target) return middle;
else if(midValue > target){
return binarySearch(nums, target, start, middle -1);
}else{
return binarySearch(nums, target, middle + 1, end);
}
}
return -1;
}
}
__________________________________________________________________________________________________
1ms
class Solution {
public int[] searchRange(int[] nums, int target) {
int[] res = {-1,-1};
int flag = 0;
for(int i = 0; i < nums.length; i++) {
if(nums[i] == target && flag == 0) {
res[0] = i;
res[1] = i;
flag = 1;
}
else if(nums[i] == target && flag == 1) {
res[1] = i;
}
}
return res;
}
}
__________________________________________________________________________________________________
class Solution {
public int[] searchRange(int[] nums, int target) {
int[] result = new int[2];
result[0] = -1;
result[1] = -1;
if(nums == null || nums.length == 0) {
return result;
}
int left = 0;
int right = nums.length - 1;
while(left + 1 < right) {
int mid = left + (right - left)/2;
if(nums[mid] == target) {
int moveLeft = mid - 1;
while(moveLeft >= 0 && nums[moveLeft] == target) {
moveLeft--;
}
int moveRight = mid + 1;
while(moveRight < nums.length && nums[moveRight] == target) {
moveRight++;
}
result[0] = moveLeft + 1;
result[1] = moveRight - 1;
System.out.println(result[0] + " " + result[1] + " result");
return result;
}
if(nums[mid] > target) {
right = mid;
}
if(nums[mid] < target) {
left = mid;
}
}
System.out.println(left + " " + right);
if(nums[left] == target && nums[right] == target) {
result[0] = left;
result[1] = right;
return result;
}
if(nums[left] == target) {
result[0] = left;
result[1] = left;
}
if(nums[right] == target) {
result[0] = right;
result[1] = right;
}
return result;
}
}
__________________________________________________________________________________________________
38140 kb
class Solution {
public int[] searchRange(int[] nums, int target) {
int[] result = {-1,-1};
if (nums == null || nums.length == 0) return result;
int left=0,right = nums.length-1;
while(left+1<right) {
int mid=left+(right-left)/2;
if(nums[mid] < target) {
left = mid;
} else {
right = mid;
}
}
System.out.println(""+ left + " " +right);
if (nums[left] == target) {
result[0] = left;
if (nums[right] == target) {
result[1] = right;
} else {
result[1] = left;
}
while (right < nums.length-1 && nums[++right] == target) result[1] = right;
} else if (nums[right] == target) {
result[0] = right;
result[1] = right;
while (right < nums.length-1 && nums[++right] == target) result[1] = right;
}
return result;
}
}
__________________________________________________________________________________________________
38292 kb
class Solution {
public int[] searchRange(int[] nums, int target) {
int p1 = 0, p2 = nums.length -1;
int[] result = {-1,-1};
while(p1 <= p2){
if(nums[p1] == target && nums[p2] == target){
result[0] = p1;
result[1] = p2;
return result;
}
if(nums[p2] > target)
p2--;
if(nums[p1] < target)
p1++;
}
return result;
}
}
__________________________________________________________________________________________________