FilesExpand file tree

 master

/

LeetCode33.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

32 lines (27 loc) · 955 Bytes

 master

/

LeetCode33.java

Copy path

Top

File metadata and controls

• Code
• Blame

32 lines (27 loc) · 955 Bytes

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

package LeetCode.array;

public class LeetCode33 {

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

int n = nums.length;

if(n == 0) return -1;

int minIndex = findMinIndex(nums, 0, n-1);

if (nums[n-1] == target) return n-1;

int start = nums[n-1] > target ? minIndex : 0;

int end = nums[n-1] > target ? n-1 : minIndex-1;

while(start <= end){

int mid = start+(end-start)/2;

if(nums[mid] > target) end = mid-1;

else if(nums[mid] < target) start = mid+1;

else return mid;

}

return -1;

}

private int findMinIndex(int[] nums, int lo, int hi){

int pre = lo, last = hi;

while(pre < last){

int mid = pre + (last-pre)/2;

if(nums[mid] > nums[last]) pre = mid+1;//这里逻辑容易陷入死循环

else last = mid;

}

return pre;

}

}