leetcode刷题，总结，记录，备忘154

leetcode154

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.
说是hard题其实有点过分了，，，其实很简单的，，不用二分也行，其实二分也很简单，

class Solution {
public:
    int findMin(vector<int>& nums) {
        if (nums.size() == 0)
        return *nums.begin();
        
        for (vector<int>::iterator it = nums.begin(); it != nums.end(); ++it)
        {
            if (*it < *(nums.end() - 1))
            return *it;
        }
        return *(nums.end() - 1);
    }
};