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

6 votes310 views2 answers
Get absolute path from relative java
Java
0 vote274 views1 answer
How to disable screenshot in react native
Java
0 vote252 views1 answer
Matlab java.lang.IllegalArgumentException: Invalid range
Java
0 vote314 views1 answer
No Java executable found in current PATH: /bin:/usr/bin:/sbin:/usr/sbin
Java
-1 vote301 views1 answer
Load contents of file into string java
Java
52 votes293 views3 answers
How to take input in java
Java
0 vote293 views1 answer
Java insert char in string at index
Java
1 vote268 views2 answers
How to uninstall java openjdk in linux
Java
0 vote297 views1 answer
Putting scanner into an array
Java
0 vote287 views2 answers
How to increase a variable once java
Java