Search in Rotated Sorted Array
LeetCode https://leetcode.cn/problems/search-in-rotated-sorted-array/
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 Solution {
public int search(int[] nums, int target) {
if (nums == null || nums.length == 0) {
return -1;
}
int left = 0;
int right = nums.length - 1;
while (left < right) {
if (nums[left] < nums[right]) {
break;
}
int mid = left + (right - left) / 2;
if (nums[mid] > nums[right]) {
left = mid + 1;
} else {
right = mid;
}
}
int offset = left;
left = 0;
right = nums.length - 1;
while (left <= right) {
int mid = left + (right - left) / 2;
int realMid = (mid + offset) % nums.length;
if (nums[realMid] == target) {
return realMid;
} else if (nums[realMid] < target) {
left = mid + 1;
} else {
right = mid - 1;
}
}
return -1;
}
}
Complexity
- Time = O(log(n))
- Space = O(1)
This post is licensed under CC BY 4.0 by the author.