/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 vote150 views1 answer
Shortcut to find a class in java project eclipse
Java
0 vote137 views1 answer
New string' is redundant error
Java
0 vote193 views1 answer
How to show the hex detail of a file in java
Java
0 vote143 views1 answer
Java show my form
Java
0 vote134 views1 answer
What's the output of the following code?
Java
0 vote195 views1 answer
Jsp get query parameter
Java
0 vote148 views1 answer
Eliminar el primer caracter de un string java
Java
0 vote135 views1 answer
Colors java intell print
Java
0 vote166 views1 answer
How to pass path parameter in url in spring rest
Java Spring
2 votes149 views5 answers
Uppercase string java
Java