/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

0 vote309 views1 answer
Java printwriter create file
Java
1 vote324 views1 answer
Convert string into time in java
Java
0 vote323 views1 answer
Esponente in java
Java
7 votes324 views2 answers
Terminate a frame java
Java
0 vote336 views1 answer
Video compression with java
Java
0 vote397 views1 answer
Spring mvc aop transaction management
Java Spring
32 votes320 views10 answers
Translate
Java
0 vote328 views1 answer
How to mutate value in vector in java
Java
0 vote372 views1 answer
Windows Jmeter java.net.BindException: Address already in use: connect
Java
0 vote386 views1 answer
Webmvctest vs springboottest
Java Spring