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 vote189 views7 answers
Convert python to java online
Java
0 vote219 views1 answer
Android studio define array
Java
-1 vote205 views1 answer
MapToString in java
Java
0 vote257 views1 answer
How to scroll down chrome browser in selenium java
Java
14 votes198 views2 answers
New hashmap java
Java
2 votes177 views1 answer
Greater than sign in java
Java
1 vote148 views1 answer
Localdate get last day of month java
Java
0 vote231 views3 answers
Fragment call activity
Java
0 vote181 views1 answer
Return class name java
Java
0 vote196 views1 answer
Java run jnlp
Java