8 lines Concise C++ 3ms binary search


  • 0
        int findMin(vector<int>& nums) {
            int i=0,j=nums.size()-1;
            int mid=(i+j)/2;
            while(i<j){
                if(nums[mid]>nums[j]) i=mid+1;
                else j=mid;
                mid=(i+j)/2;
            }
            return nums[mid];
        }
    

Log in to reply
 

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