标签：leetcode   算法   

问题描述：

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.

思路：

找出A[i-1] > A[i]的位置。

代码：

int findMin(vector<int> &num) {   //c++
        int size = num.size();
        for(int i = 1; i < size; i++){
            if(num[i] < num[i-1]){
                return num[i];
            }
        }
        
        return num[0];
    }

[leetcode]Find Minimum in Rotated Sorted Array

标签：leetcode   算法   

原文地址：http://blog.csdn.net/chenlei0630/article/details/40787077