Find Minimum in Rotated Sorted Array II

Problem

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.

Solution

就多了一个当 nums[mid] == nums[right] 的一个判断。

只能一步一步向右走来判断是否一样。。。。

class Solution {
public:
    int findMin(vector<int>& nums) {
       int left = 0, right = nums.size() -1;
        
        while( left < right) {
            int mid = (left + right) /2;
            if(nums[mid] < nums[right]){
                right = mid;
            }
            else if(nums[mid] > nums[right]) {
                left = mid + 1;
            }
            else {
                bool rightSame = true;
                for( int i = mid + 1; i < right; i++){
                    if( nums[i] != nums[i-1]){
                        rightSame = false; break;
                    }
                }
                rightSame ? right = mid : left = mid + 1; 
                
            }
        }
        return nums[left];
                
    }
};