LeetCode--Find Minimum in Rotated Sorted Array II

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.

class Solution 
{
public:
    int findMin(vector<int> &num) 
    {
        int n = num.size();
        if(n==1)
            return num[0];
        for(int i=1; i<num.size(); i++)
        {
            if(num[i]<num[i-1])
                return num[i];
        }
        return num[0];
    }
};

LeetCode--Find Minimum in Rotated Sorted Array II

原文：http://blog.csdn.net/shaya118/article/details/42746619