leetcode/Problem34.java at master · actor168/leetcode · GitHub

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
classProblem34 {

publicstaticvoidmain(String[] args) {
int[] nums = {5,7,7,8,8,10};
inttarget = 8;
int[] res = newProblem34().searchRange(nums, target);
System.out.printf("%s,%s\n",res[0], res[1]);
 }

publicint[] searchRange(int[] nums, inttarget) {
returnbinary(nums, target, 0, nums.length-1);
 }

int[] binary(int[] nums, inttarget, intl, intr) {
booleanfind = true;
if (l > r) {
find = false;
 }
if (l == r) {
if (target != nums[l]) find = false;
elsereturnnewint[]{l, l};
 }

if (!find) returnnewint[]{-1,-1};

intmid = l + (r - l) / 2;
if (nums[mid] == target) {
System.out.println(mid);
inti = 0, j = 0;
for(i=mid; i>l && nums[--i] == target;){}
for(j=mid; j<r && nums[++j] == target;){}
if (nums[i] != target) i++;
if (nums[j] != target) j--;
returnnewint[]{i, j};
 } elseif (nums[mid] < target){
l = mid+1;
 } else {
r = mid-1;
 }
returnbinary(nums, target, l, r);
 }
}