【Leetcode】Find Minimum in Rotated Sorted Array

Suppose a sorted array is rotated at some pivot unknown to you beforehand.

(i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2).

Find the minimum element.

You may assume no duplicate exists in the array.

Java:

http://blog.csdn.net/linhuanmars/article/details/40449295

二分：时间：O(logn)，空间上只有四个变量维护二分和结果，所以是O(1)

public class Solution {
    public int findMin(int[] num) {
        if(num==null||num.length==0) return 0;
       int l=0;
       int r=num.length-1;
       int min=num[0];
       while(l<r-1){
           int m=(l+r)/2;
           if(num[l]<num[m]){
               min=Math.min(num[l],min);
               l=m+1;
           }
           else if(num[l]>num[m]){
               min=Math.min(num[m],min);
               r=m-1;
           }
           else{
               l++;
           }
       }
       min=Math.min(num[r],min);
       min=Math.min(num[l],min);
       return min;
    }
}