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

5 votes167 views2 answers
Spring boot security maven
Java
3 votes219 views5 answers
Calc
Java
1 vote173 views1 answer
Why can we implement multiple interfaces
Java
1 vote177 views2 answers
Java print boolean with spaces
Java
0 vote172 views1 answer
Declare id in java
Java
2 votes167 views4 answers
Find char in string java
Java
0 vote178 views1 answer
Place.getlatlng() returning null
Java
1 vote227 views1 answer
Spring boot id auto generated
Java
0 vote186 views1 answer
LicenceUrl
Java
5 votes164 views1 answer
How to convert object to list in java
Java