FilesExpand file tree

 master

/

SearchRotateArray2.java

Copy path

BlameMore file actions

BlameMore file actions

Latest commit

 

History

History

History

55 lines (49 loc) · 1.58 KB

 master

/

SearchRotateArray2.java

Top

File metadata and controls

• Code
• Blame

55 lines (49 loc) · 1.58 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

43

44

45

46

47

48

49

50

51

52

53

54

55

package LeetCodeOJ;

import java.util.Queue;

import java.util.Stack;

/* 81.Search in Rotated Sorted Array II

* Follow up for "Search in Rotated Sorted Array":

What if duplicates are allowed?

*/

public class SearchRotateArray2 {

/*

* ��ͬ�ķ�����leetcode��վ�ύ�Ľ��

*/

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

int low = 0;

int high = nums.length - 1;

int mid = 0;

while (low <= high) {

// ����ļ����д����Դ������ط���˼�롣

mid = (low + high) / 2;

if (target == nums[mid]) {

return true;

}

if (nums[low] < nums[mid]) {

// �������

if (target < nums[mid] && target >= nums[low]) {

high = mid - 1;

} else {

low = mid + 1;

}

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

// ��������ұ�����

if (target > nums[mid] && target <= nums[high]) {

low = mid + 1;

} else {

high = mid - 1;

}

}

// low == mid 可能是出现多个元素

else {

low++;

}

}

return false;

}

public static void main(String[] args) {

int[] n = { 4, 5, 6, 7, 7, 8, 0, 1, 1, 2, 3 };

// int [] n ={1,0,1,1,1,1,1};

System.out.println(new SearchRotateArray2().search(n, 1));

}

}