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.

代码实现：

#include <iostream>
#include<vector>

using namespace std;
class Solution {
public:
	int findMin(vector<int> &num) {
		int low = 0;
		int high= num.size()-1;

		while (low<high) 
		{
			if (num[low]<num[high])
				return num[low];
			int cur =(low+high)/2;
			if (num[cur]<num[low])
				high=cur;
			else
				low=cur+1;
		}
		return num[low];
	}
};
void main()
{
	int A[8]={6,7,8,1,2,3,4,5};
	vector<int> num(A,A+8);
	Solution s;
	cout<<s.findMin(num)<<endl;
	getchar();
}