LeetCode Find Minimum in Rotated Sorted Array II

Find Minimum in Rotated Sorted Array II Total Accepted: 23090 Total Submissions: 73108 My Submissions Question Solution
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>& nums) {
        int size=nums.size();
        int MIN=nums[0];
        for(int i=1;i<size;++i)
            if(nums[i]<MIN)MIN=nums[i];
        return MIN;
    }
};

188 / 188 test cases passed.
Status: Accepted
Runtime: 12 ms