java, o(n), four lines of code


  • 0
    M
    public class Solution {
        public int findMin(int[] nums) {
            
            for(int i=0; i<nums.length-1; i++){
                if(nums[i+1]<nums[i])
                    return nums[i+1];
            }
            
            return nums[0];
        }
    }
    

Log in to reply
 

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