Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Appearance settings

Latest commit

 

History

History
History
36 lines (34 loc) · 986 Bytes

File metadata and controls

36 lines (34 loc) · 986 Bytes
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
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
package leetcode.binarySearch;
public class leetcode34 {
public static void main(String[] args) {
new leetcode34().searchRange(
new int[]{
1
},1
);
}
public int[] searchRange(int[] nums, int target) {
int result[]=new int[2];
result[0]=result[1]=-1;
int head=0;
int tail=nums.length-1;
while(head<=tail){
int md=(head+tail)/2;
if(target==nums[md]){
result[0]=result[1]=md;
int before=md;
int after=md;
while(--before>-1&&nums[before]==target){}
result[0]=before+1;
while(++after<nums.length&&nums[after]==target){}
result[1]=after-1;
break;
}else if(target>nums[md]){
head=md+1;
}else{
tail=md-1;
}
}
return result;
}
}
Morty Proxy This is a proxified and sanitized view of the page, visit original site.