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).

public class Solution {

public int findMin(int[] nums) { int min=nums[0]; for(int i=1;i<nums.length;i++){ if(min>nums[i]) return nums[i]; } return min; }

}

Can be done in O(log N) using binary search approach.

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