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 vote188 views1 answer
Com.android.okhttp.internal.http.HttpURLConnectionImpl cannot be cast to javax.net.ssl.HttpsURLConnection
Java
2 votes177 views2 answers
Spigot run task later
Java
0 vote241 views1 answer
Print zpl from java
Java
0 vote184 views1 answer
Spinner get items
Java
0 vote187 views1 answer
Android list tostring
Java
10 votes203 views2 answers
Maven test class
Java
6 votes180 views6 answers
Java do while loop example
Java
2 votes195 views3 answers
Java main
Java
0 vote300 views1 answer
Java code to compare csv file against a table
Java
0 vote183 views1 answer
Call http url from java rest remplates
Java