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 vote114 views1 answer
Kotlin registerForActivityResult
Java
0 vote117 views1 answer
The longest substring
Java
1 vote127 views1 answer
Context error in android studio
Java
0 vote125 views1 answer
["org.elasticsearch.bootstrap.startupexception: java.lang.illegalstateexception: failed to obtain node locks,
Java
0 vote120 views1 answer
Java JPanel set background color
Java
0 vote153 views1 answer
C:\elastic stack\elasticsearch-7.15.1-windows-x86_64\elasticsearch-7.15.1\bin>java -version java version "1.8.0_311" Java(TM) SE Runtime Environment (build 1.8.0_311-b11) Java HotSpot(TM) Client VM (build 25.311-b11, mixed mode, sharing)
Java
0 vote126 views1 answer
Icon share android
Java
1 vote115 views1 answer
Sc.nextline skips
Java
0 vote115 views1 answer
Usaco 2018 january contest
Java
-1 vote153 views1 answer
Spring security after login redirect
Java