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 vote322 views1 answer
Phone call using intent in Android
Java
0 vote395 views1 answer
Spring data jpa inheritance repository
Java Spring
0 vote306 views1 answer
Get an element from an arraylist java
Java
0 vote297 views1 answer
Spring boot jackson infinite recursion
Java
0 vote312 views1 answer
Java file creation date
Java
0 vote324 views1 answer
Java kommazahl abschneiden
Java
2 votes384 views1 answer
Cannot lock java compile cache as it has already been locked by this process
Java
0 vote295 views1 answer
How to get child from layout in android
Java
-1 vote303 views6 answers
What is java
Java
0 vote327 views1 answer
Java class creation inside method
Java