p148 Minimum value of rotated ordered array (leetcode 153)

One: solution to the problem

This topic is a variant of binary search. Time: log (n), Space: O (1)

Two: complete code examples (C ++ version and Java version)

C++:

class Solution {
public:
    int findMin(vector<int>& nums) 
    {
        int low = 0;
        int high = nums.size() - 1;
        while (low < high)
        {
            int mid = low + (high-low) / 2;
            if (nums[mid] > nums[high]) low = mid + 1;
            else high = mid;
        }

        return nums[low];
    }
};

Java:

class Solution {
        public int findMin(int[] nums) 
        {
               int low=0;
               int high=nums.length-1;
               while (low<high)
               {
                   int mid=low+(high-low)/2;
                   if(nums[mid]>nums[high]) low=mid+1;
                   else high=mid;
               }
               
               return nums[low];
        }
    }