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 vote139 views2 answers
Runtime intalize array in java
Java
1 vote99 views1 answer
Java to kotlin converter
Java
3 votes146 views2 answers
Random boolean java
Java
2 votes141 views2 answers
How to change orientation of linearlayout in recyclerview android
Java
2 votes169 views1 answer
How to check if the file has remaining without reading from it java
Java
0 vote141 views1 answer
Get device token firebase
Java
1 vote151 views1 answer
How to get path of captured image in android
Java
1 vote157 views1 answer
Spring boot jpa in clause
Java
1 vote172 views1 answer
How to get index of second occurrence java
Java
8 votes158 views3 answers
How to create a java txt file from programm
Java