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

16 votes366 views4 answers
Android studio alert dialog box
Java
1 vote344 views2 answers
Java join list of strings
Java
0 vote344 views1 answer
Cannot be applied to 'java.lang.String', 'java.lang.Double java
Java
0 vote357 views1 answer
Osmdroid get current zoom level
Java
1 vote349 views1 answer
Java calculate delta time from thread
Java
-1 vote360 views1 answer
How to do press enter to continue in java
Java
-2 votes369 views2 answers
Create new empty list java
Java
1 vote348 views1 answer
How to get a section of an array in java
Java
0 vote346 views2 answers
Android volley benefits
Java
0 vote345 views1 answer
Printing different lines in array java
Java