Pivot in 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

6 votes242 views1 answer
Javafx tableview remove clear all data
Java
0 vote262 views1 answer
How to load template file from resource folder in spring boot project
Java
13 votes229 views2 answers
What is junit
Java
0 vote243 views1 answer
Expression régulière seulement un espace java
Java
4 votes250 views1 answer
Connect sql server to xampp
Java Spring
5 votes226 views1 answer
Java check data type
Java
3 votes225 views1 answer
Regrex for letter in java
Java
1 vote278 views2 answers
Spring boot docker
Java Spring
0 vote255 views2 answers
Calculate smallest angle difference
Java
0 vote224 views1 answer
Ripple effect textview android
Java