leetcode/java/0033-search-in-rotated-sorted-array.java at main · ColstonBod-oy/leetcode · GitHub

Name: leetcode/java/0033-search-in-rotated-sorted-array.java at main · ColstonBod-oy/leetcode · GitHub
Rating: 4.5 (932 reviews)
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
classSolution {

publicintsearch(int[] nums, inttarget) {
intminIndex = minIndex(nums);
intleftSearch = binarySearch(nums, 0, minIndex - 1, target);
intrightSearch = binarySearch(nums, minIndex, nums.length - 1, target);
if (leftSearch != -1) {
returnleftSearch;
 } elseif (rightSearch != -1) {
returnrightSearch;
 } else {
return -1;
 }
 }

publicintminIndex(int[] nums) {
intstart = 0;
intend = nums.length - 1;
while (start <= end) {
intmid = start + (end - start) / 2;
intprev = (mid - 1 + nums.length) % nums.length;
intnext = (mid + 1) % nums.length;
if (nums[mid] <= nums[prev] && nums[mid] <= nums[next]) {
returnmid;
 } elseif (nums[mid] <= nums[end]) {
end = mid - 1;
 } elseif (nums[mid] >= nums[start]) {
start = mid + 1;
 }
 }
return -1;
 }

publicintbinarySearch(int[] nums, intstart, intend, inttarget) {
while (start <= end) {
intmid = start + (end - start) / 2;
if (nums[mid] == target) {
returnmid;
 } elseif (nums[mid] < target) {
start = mid + 1;
 } else {
end = mid - 1;
 }
 }
return -1;
 }
}