[LeetCode] Find Minimum in Rotated Sorted Array 二分搜索

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

class Solution {
public:
    int findMin(vector<int> &num) {
        int n = num.size();
        if(n<2||num[0]<num[n-1]) return num[0];
        int lft=0,rgt=n-1,mid=n-1;
        while(lft+1<rgt){
            if(num[mid-1]>num[mid]) break;
            mid = (lft+ rgt)/2;
            cout<<lft<<" "<<mid<<" "<<rgt<<endl;
            if(num[lft]<num[mid])   lft=mid;
            else    rgt=mid;
            mid = rgt;
        }
        return num[mid];
    }
};

int main()
{
    vector<int> num{3,4,5,6,1,2};
    Solution sol;
    cout<<sol.findMin(num)<<endl;
    return 0;
}