标签：style blog io ar color os sp for on
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.
class Solution { public: int findMin(vector<int> &num) { int len = num.size(); for(int i = 1; i<len;i++){ if(num[i] < num[i-1]) return num[i]; } return num[0]; } };
Find Minimum in Rotated Sorted Array
标签：style blog io ar color os sp for on
原文地址：http://www.cnblogs.com/code-swan/p/4139552.html
