Find Minimum in Rotated Sorted Array II--LeetCode

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 4 5 6 7 might become 4 5 6 7 0 1 2).

Find the minimum element.

The array may contain duplicates.

思路：可能有重复，那么就需要慢慢的移动了

#include <iostream>
#include <vector>
#include <string>
using namespace std;

int FindMin(vector<int>& vec)
{
    int low=0,high = vec.size()-1;
    int mid,minnum;
    minnum = vec[0];
    while(low<= high)
    {
      mid = low+ (high-low)/2;
      cout<<mid<<endl;
      if(high-1 == low)
       minnum = min(minnum,min(vec[low],vec[high]));
      if(vec[low] < vec[mid]) // 升序
      {
          minnum = min(minnum,vec[low]);
          low = mid+1;       
      }                
      else if(vec[mid] < vec[high])
      {
         minnum = min(minnum,vec[mid]);
         high = mid-1;    
      }     
      else
         low++;     
    } 
    return minnum;
}
int main()
{
    int array[] = {9,8,7,6,5,4,3,2,1};
    vector<int> vec(array,array+sizeof(array)/sizeof(array[0]));
    cout<<FindMin(vec);
    system("pause"); 
    return 0;
    } 

ps:为什么第三种情况下，使用的是low++呢，因为这个数组中可能出现了重复的数导致了vec[low] == vec[mid] ==vec[high],这个时候需要low++，或者是整个数组发生了全旋转，导致了vec[low]最大