/Java/Find Minimum in Rotated Sorted Array

Find Minimum in Rotated Sorted Array

// https://leetcode.com/problems/find-minimum-in-rotated-sorted-array
// assuming Array has no duplicates
class Solution {
    public int findMin(int[] nums) {
        int start = 0;
        int end  = nums.length-1;
        
        while (start < end){
            int mid = start + (end-start)/2;
            if (nums[mid] > nums[end]) start = mid+1;
            if (nums[mid] < nums[end]) end = mid;
        }
        return nums[start];
    }
}

Similar codes

0 vote321 views1 answer
How to get all super class of a java class
Java
11 votes303 views1 answer
Java stack methods
Java
0 vote275 views2 answers
Worldedit api paste schematic
Java
0 vote304 views1 answer
Get text from a jtextfield
Java
1 vote284 views1 answer
Java calculate fps from thread
Java
0 vote262 views1 answer
Java schleife abbrechen
Java
0 vote287 views1 answer
How to change custom font to bold italic in java
Java
2 votes272 views1 answer
Primefaces custom validate
Java
-3 votes346 views5 answers
Pasar ejercicios de pseint a java
Java
7 votes305 views6 answers
Fibonacci sequence
Java