6 lines concise and easy understand c++ solution


  • 1
    A
    class Solution {
    public:
        int findMin(vector<int>& nums) {
            int l = 0, r = nums.size() - 1;
            while(l < r){
                int mid = l + (r - l)/2;
                nums[mid] > nums[r] ? l = mid + 1 : r = mid;
            }
            return nums[r];
        }
    };

Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.