My Solution with binary search


  • 0
    B
     public int findMin(int[] nums) {
            int start = 0;
    		int end = nums.length - 1;
    		int mid;
    		while (start < end) {
    			mid = (end + start) / 2;
    			if (nums[mid] > nums[end]) {
    				start = mid + 1;
    			} else if (nums[mid] < nums[start]) {
    				end = mid;
    			} else {
    				break;
    			}
    		}
    		return nums[start];
        }

Log in to reply
 

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