/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 vote162 views1 answer
Spring amqp exchange not found
Java
3 votes155 views1 answer
WHAT IS JRE
Java
2 votes159 views1 answer
Java variable in string
Java
16 votes161 views4 answers
Android studio alert dialog box
Java
0 vote153 views1 answer
How to get stack trace of a function in java
Java
1 vote154 views2 answers
On touch listener android
Java
15 votes182 views4 answers
Reverse int array java
Java
0 vote162 views2 answers
How to turna date into a LocalDateTime java
Java
3 votes151 views1 answer
How to change font
Java
1 vote157 views1 answer
Java reverse a word
Java