leetcode Find Minimum in Rotated Sorted Array II

参考



http://blog.csdn.net/linhuanmars/article/details/40449299

代码

class Solution {public:    int findMin(vector<int> &num) {                if(num.size()==0)          return 0;          int l = 0;          int r = num.size()-1;          int minNum = num[0];          while(l<r-1)          {              int m = (l+r)/2;              if(num[l]<num[m])              {                  minNum = min(num[l],minNum);                  l = m+1;              }              else if(num[l]>num[m])              {                  minNum = min(num[m],minNum);                  r = m-1;              }              else              {                  l++;              }          }          minNum = min(num[r],minNum);          minNum = min(num[l],minNum);          return minNum;   }};