！leetcode[153 & 154]:Find Minimum in Rotated Sorted Array I & II

Find Minimum in Rotated Sorted Array

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.

You may assume no duplicate exists in the array.

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

同样的代码可以解决：
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.

但是时间复杂度高！！！待改进～～～～～