《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.

構想

"Find Minimum in Rotated Sorted Array"                     。

コードをもう一度貼ります.次のようにします.

/*       ，               k   。       ，                           ；          ：  k=0；           */

int findMin(int* nums, int numsSize) {
    if(nums==NULL||numsSize<1){
        return 0;
    }
    int minRes=nums[0];
    for(int i=0;i<numsSize-1;i++){      
        if(nums[i+1]<nums[i]){
            return nums[i+1];
        } 
    }
    return minRes;
}