FilesExpand file tree

 master

/

Problem34.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

42 lines (37 loc) · 1.18 KB

 master

/

Problem34.java

Top

File metadata and controls

• Code
• Blame

42 lines (37 loc) · 1.18 KB

Raw

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

37

38

39

40

41

42

class Problem34 {

public static void main(String[] args) {

int[] nums = {5,7,7,8,8,10};

int target = 8;

int[] res = new Problem34().searchRange(nums, target);

System.out.printf("%s,%s\n",res[0], res[1]);

}

public int[] searchRange(int[] nums, int target) {

return binary(nums, target, 0, nums.length-1);

}

int[] binary(int[] nums, int target, int l, int r) {

boolean find = true;

if (l > r) {

find = false;

}

if (l == r) {

if (target != nums[l]) find = false;

else return new int[]{l, l};

}

if (!find) return new int[]{-1,-1};

int mid = l + (r - l) / 2;

if (nums[mid] == target) {

System.out.println(mid);

int i = 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--;

return new int[]{i, j};

} else if (nums[mid] < target){

l = mid+1;

} else {

r = mid-1;

}

return binary(nums, target, l, r);

}

}