https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/
Explanation1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21// java collection methods
class Solution {
public int findMin(int[] nums) {
List<Integer> ls=new ArrayList<>();
for(int i:nums) ls.add(i);
Collections.sort(ls/*,(i1,i2)->i1-i2*/);
return ls.get(0);
}
}
// Binary search
class Solution {
public int findMin(int[] nums) {
int l=0,r=nums.length-1;
while(l<r){
int m=l+(r-l)/2;
if(nums[m]>nums[r]) l=m+1;
else r=m;
}
return nums[l];
}
}