Very simple Java solution based on Binary Search


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

Log in to reply
 

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