-
Notifications
You must be signed in to change notification settings - Fork 25
Expand file tree
/
Copy pathSearch.java
More file actions
39 lines (35 loc) · 1.05 KB
/
Copy pathSearch.java
File metadata and controls
39 lines (35 loc) · 1.05 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
package com.lga.algorithm.tag.homework.Week_04;
/**
* 33. 搜索旋转排序数组
* https://leetcode-cn.com/problems/search-in-rotated-sorted-array/
*/
public class Search {
public int search(int[] nums, int target) {
if (nums == null) return -1;
int start = 0;
int end = nums.length - 1;
int mid;
while (start <= end) {
mid = start + (end - start) / 2;
if (nums[mid] == target) {
return mid;
}
//前半部分有序,注意此处用小于等于
if (nums[start] <= nums[mid]) {
//target在前半部分
if (target >= nums[start] && target < nums[mid]) {
end = mid - 1;
} else {
start = mid + 1;
}
} else {
if (target <= nums[end] && target > nums[mid]) {
start = mid + 1;
} else {
end = mid - 1;
}
}
}
return -1;
}
}