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 vote273 views1 answer
Stackoverflow java enum with constructor
Java
0 vote283 views1 answer
Hgjhghj
Java
-1 vote393 views1 answer
Spring boot show sql
Java Spring
0 vote339 views1 answer
Webmvctest vs springboottest
Java Spring
0 vote272 views1 answer
Java running sum of array
Java
3 votes254 views2 answers
How to read json object from text file in java
Java
0 vote261 views1 answer
Java :: operator
Java
0 vote268 views1 answer
Change fab image programatically
Java
1 vote306 views2 answers
Java arraylist with double
Java
0 vote291 views1 answer
On selected item changed listview javafx
Java