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 vote279 views1 answer
@interceptor not working java
Java
0 vote274 views1 answer
Ejemplo for java
Java
1 vote262 views1 answer
Mockito throw exception void method
Java
0 vote319 views1 answer
How to add classpath in spring boot
Java Spring
0 vote255 views1 answer
Spigot disable join message
Java
0 vote258 views1 answer
Add integers java
Java
0 vote265 views1 answer
What does .hasNext() do in java
Java
0 vote277 views1 answer
No suitable driver found for jdbc:mysql
Java
5 votes242 views2 answers
Getcolor deprecated
Java
0 vote261 views1 answer
Java minimize all windows
Java