public class Solution {
// Find the sorted part with smaller number
public int findMin(int[] num) {
int min = Integer.MAX_VALUE;
int l = 0;
int r = num.length-1;
while(l<r){
if (num[l]<num[r]){
break;
}
int m = (l+r)/2;
if (num[l]<=num[m]){
l=m+1;
}else{
r=m;
}
}
return num[l];
}
}
Find Minimum in Rotated Sorted Array
最新推荐文章于 2022-05-26 16:47:57 发布