leetcode------Find Minimum in Rotated Sorted Array II

标题：	Find Minimum in Rotated Sorted Array II
通过率：	31.1%
难度：	难

Follow up for "Find Minimum in Rotated Sorted Array":
What if duplicates are allowed?

Would this affect the run-time complexity? How and why?

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.

The array may contain duplicates.

再第一版本中我已经详细介绍了旋转数组的特点。

Find Minimum in Rotated Sorted Array可以直接点击去看我对于旋转数组的分析。本题直接看代码

public class Solution {
    public int findMin(int[] num) {
        int start=0,end=num.length-1,mid=0;
        while(start<end&&num[start]>=num[end]){
            mid=(start+end)/2;
            if(num[mid]>num[end])start=mid+1;
            else if(num[mid]<num[end])end=mid;
            else start+=1;
        }
        return num[start];
    }
}