/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

1 vote187 views1 answer
"java.lang.NoClassDefFoundError: org/yaml/snakeyaml/LoaderOptions"
Java
3 votes197 views2 answers
Polar to cartesian java
Java
1 vote251 views1 answer
Spring scheduled
Java Spring
0 vote237 views1 answer
Get intersection of two lists java
Java
1 vote203 views4 answers
Convert kotlin to java online editor
Java
1 vote195 views1 answer
Recompile with -Xlint:deprecation
Java
0 vote197 views1 answer
Uri/Beecrowd problem no - 1146 solution in Java
Java
9 votes199 views2 answers
Int list
Java
0 vote194 views1 answer
Extracting kubernetes podname from java
Java
5 votes238 views1 answer
Print up to 2 decimal in java
Java