-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathSolution.java
More file actions
48 lines (44 loc) · 1.17 KB
/
Solution.java
File metadata and controls
48 lines (44 loc) · 1.17 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
40
41
42
43
44
45
46
47
48
package leetCode_33;
/**
* @author dimdark
*/
public class Solution {
public int search(int[] nums, int target) {
if (nums == null || nums.length == 0) {
return -1;
}
int minIdx = findMinIndex(nums); // steps of moving
int low = 0;
int high = nums.length - 1;
int mid, realMid;
while (low <= high) {
mid = low + ((high - low) >> 1);
realMid = (mid + minIdx) % nums.length; // map to real index
if (nums[realMid] == target) {
return realMid;
} else if (nums[realMid] < target) {
low = mid + 1;
} else {
high = mid - 1;
}
}
return -1;
}
private int findMinIndex(int[] nums) {
if (nums == null || nums.length == 0) {
return -1;
}
int low = 0;
int high = nums.length - 1;
int mid;
while (low < high) {
mid = low + ((high - low) >> 1);
if (nums[mid] > nums[high]) {
low = mid + 1;
} else {
high = mid;
}
}
return low;
}
}