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

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.

：思路，還是二分查找。不過當有重複數據時，且：nums[start] == nums[mid] && nums[mid] == nums[end]時，只能順序遍歷。

class Solution {
public:
    int findMin(vector<int>& nums) {
        int start = 0;
        int end = nums.size() - 1;
        int mid = start;
        while(nums[start] >= nums[end])
        {
            if(end - start == 1)
            {
                mid = end;
                break;
            }
            mid = (start + end) / 2;
            if(nums[start] == nums[mid] && nums[mid] == nums[end])
                return min(nums,start,end);
            if(nums[start] <= nums[mid])
                start = mid;
            else
                end = mid;
        }
        return nums[mid];
    }
private:
    int min(vector<int>& num,int low,int high)
    {
        int mintmp = num[low];
        while(low <= high)
        {
            if(num[low] < mintmp)
                mintmp = num[low];
            ++low;
                
        }
        return mintmp;
    }
};