Find Minimum in Rotated Sorted Array

来源:互联网 发布:矩阵运算公式 编辑:程序博客网 时间:2024/06/04 19:18
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];    }}

0 0
原创粉丝点击