题目描述：
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.
解题方案：
直接贴代码，因为我没有太明白题目描述那么多是怎么意思。如果那位大神明白了，请告诉我。轻喷！！！
1 class Solution { 2 public: 3 int findMin(vector<int> &num) { 4 int MinElem = INT_MAX; 5 for (size_t i = 0; i <num.size(); ++i) { 6 if (num[i] < MinElem) { 7 MinElem = num[i]; 8 } 9 } 10 return MinElem; 11 } 12 };
Find Minimum in Rotated Sorted Array
原文：http://www.cnblogs.com/skycore/p/4029887.html