[leetcode]-154. Find Minimum in Rotated Sorted Array II（C语言）

Suppose an array sorted in ascending order 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.

Example 1:

Input: [1,3,5]
Output: 1

Example 2:

Input: [2,2,2,0,1]
Output: 0

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