Isn't this problem very straight forward...?1ms java solution...

  • 0

    Isn't this problem very straight forward....? My accepted 1ms 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];

  • 1

    Your solution is O(n). You need to use quick sort to reduce the time complexity to O(logn)

Log in to reply

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