Your browser does not seem to support JavaScript. As a result, your viewing experience will be diminished, and you have been placed in read-only mode.

Please download a browser that supports JavaScript, or enable it if it's disabled (i.e. NoScript).

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]; }

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

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