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

1 vote252 views2 answers
Scanner_Java
Java
0 vote267 views1 answer
Exception in thread "main" java.util.zip.ZipException: error
Java
0 vote268 views1 answer
Public void add(int index e element)
Java
-1 vote247 views1 answer
Java in 5 minutes
Java
1 vote252 views2 answers
Dialog box in java swing
Java
0 vote276 views1 answer
Ava program to add two numbers taking input from user
Java
3 votes240 views2 answers
Java hex to rgb
Java
1 vote263 views1 answer
How to print two variables in same line in java
Java
0 vote277 views2 answers
How to select multiple non-consecutive words on mac
Java
0 vote259 views1 answer
How to use advanced math in java
Java