-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathleetcode34.java
More file actions
74 lines (72 loc) · 2.41 KB
/
leetcode34.java
File metadata and controls
74 lines (72 loc) · 2.41 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
public class leetcode34 {
/*public int[] searchRange(int[] nums, int target) {
int down = 0;
int up = nums.length - 1;
int mid = 0;
int[] result = new int[]{-1,-1};
if(nums.length == 0) return result;
while(down < up) {
mid = down +(up - down) /2 ;
if(nums[mid] == target) break;
if(nums[mid] > target) up = mid - 1;
else if(nums[mid] < target) down = mid + 1 ;
}
if(nums[down] == target) mid = down;
down = mid;
up = mid;
while(down > 0 && nums[down] == nums[down - 1]) down--;
while(up < nums.length - 1 && nums[up] == nums[up + 1]) up++;
if(nums[mid] == target){
result[0] = down;
result[1] = up;
}
return result;
}*/
public static void main(String[] args) {
int[] number = new int[]{2,2};
int[] result = searchRange(number, 8);
for(int a: result) System.out.println(a);
}
public static int[] searchRange(int[] nums, int target) {
int[] result = new int[2];
int left = left_search(nums, target);
left = left == 1? -1 : left;
int right = right_search(nums,target);
right = right == 0? -1: right;
return new int[]{left, right};
}
public static int left_search(int[] nums, int target) {
if(nums.length == 0) return -1;
int down = 0;
int up = nums.length;
while(down < up) {
int mid = (down + up) /2;
if(nums[mid] == target) {
up = mid;
} else if (nums[mid] < target) {
down = mid + 1;
} else if(nums[mid] > target) {
up = mid;
}
}
if(down == nums.length) return -1;
return nums[down ] == target? down : -1;
}
public static int right_search(int[] nums, int target) {
if(nums.length == 0) return -1;
int down = 0;
int up = nums.length;
while(down < up) {
int mid = (down + up) /2;
if(nums[mid] == target) {
down = mid + 1;
} else if (nums[mid] < target) {
down = mid + 1;
} else if(nums[mid] > target) {
up = mid;
}
}
if(down == 0) return -1;
return nums[down - 1] == target? down- 1 : -1;
}
}