/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 vote221 views1 answer
How to convert errorBody to pojo in retrofit
Java
16 votes200 views2 answers
Java random usage
Java
0 vote212 views1 answer
Initialize generic array java
Java
0 vote240 views2 answers
How to set edittext color in android
Java
0 vote224 views1 answer
Deps-jar
Java
1 vote239 views1 answer
Java transfer file over socket
Java
0 vote216 views1 answer
Previous method in jdbc
Java
1 vote224 views1 answer
Java flatten list
Java
1 vote238 views2 answers
Java setinterval equivalent
Java
0 vote214 views1 answer
Set image programmatically android
Java