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 vote159 views1 answer
How to change numbers to English in printf
Java
1 vote195 views2 answers
SetText int java
Java
1 vote167 views1 answer
Android how to don't show keyboard
Java
0 vote168 views1 answer
Detect tv remote keys andoid studio
Java
4 votes179 views1 answer
Java how to print a string[]
Java
0 vote237 views1 answer
Variable name in java
Java
0 vote174 views2 answers
Dropdown show hide div event in jsp
Java
1 vote169 views6 answers
Android hide keyboard
Java
1 vote175 views1 answer
Load a file from classpath spring boot
Java
0 vote168 views1 answer
Java map string to list
Java