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 2 2 2 7 might become 2 2 2 2 7 0 1).
Find the minimum element.
The array may contain duplicates.

代码实现：

#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[low]<num[cur])
			    low=cur+1;
		    else if(num[low]==num[cur])
		        low++;    
			else
				high=cur;
		}
		return num[low];
	}
};
void main()
{
	int A[8]={4,4,1,4,4,4,4,4};
	vector<int> num(A,A+8);
	Solution s;
	cout<<s.findMin(num)<<endl;
	getchar();
}