-
Notifications
You must be signed in to change notification settings - Fork 2
Expand file tree
/
Copy pathFindMinimumInRotatedSortedArray2.java
More file actions
38 lines (37 loc) · 1.06 KB
/
FindMinimumInRotatedSortedArray2.java
File metadata and controls
38 lines (37 loc) · 1.06 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
public class FindMinimumInRotatedSortedArray2 {
public int findMin0(int[] nums) {
int low = 0;
int high = nums.length - 1;
int minId = -1;
while (low <= high) {
if (low == high || nums[low] < nums[high]) {
return nums[low];
}
int mid = low + ((high - low) >> 1);
if (nums[mid] > nums[low]) {
low = mid + 1;
} else if (nums[mid] < nums[low]){
high = mid;
} else {
low++;
}
}
return minId == -1 ? Integer.MAX_VALUE : nums[minId];
}
//Better solution
public int findMin(int[] nums) {
int low = 0;
int high = nums.length - 1;
while (low < high) {
int mid = low + ((high - low) >> 1);
if (nums[mid] < nums[high]) {
high = mid;
} else if (nums[mid] > nums[high]) {
low = mid + 1;
} else {
high--;
}
}
return nums[low];
}
}