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

0 vote269 views1 answer
Enable cors on apache tomcat
Java
0 vote238 views1 answer
Float maximum value java
Java
2 votes263 views2 answers
How to convert date to dd-mon-yyyy format in java
Java
2 votes202 views1 answer
Get tfidf score for a sentence
Java
8 votes213 views1 answer
Java timestamp
Java
1 vote196 views1 answer
Arraylist index java
Java
4 votes196 views1 answer
The package java.awt.event is not accessible
Java
0 vote198 views1 answer
Java filewriter not working
Java
0 vote200 views1 answer
Pgzint install windows 10
Java
-1 vote190 views2 answers
Java web app login system
Java