/Java/Find Minimum in Rotated Sorted Array

Find Minimum in Rotated Sorted 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

2 votes199 views2 answers
How to set spinner value in android
Java
0 vote191 views1 answer
How to make jenkins pipeline choose specific java version
Java
0 vote191 views1 answer
Csc
Java
15 votes213 views6 answers
Factorial
Java
14 votes190 views2 answers
Java string array initialization
Java
0 vote220 views1 answer
Android studio constraint layout proportional height
Java
1 vote191 views1 answer
Run specific test case junit
Java
0 vote211 views1 answer
Kafkalistener annotation pass topic from properties file
Java
3 votes210 views1 answer
Declare array with values java
Java
0 vote190 views1 answer
Java switch expression produce result
Java