/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

1 vote216 views1 answer
How to test how many of one character is in a string java
Java
4 votes224 views2 answers
Remove first character from string java
Java
0 vote193 views1 answer
Spring boot send api request
Java
0 vote200 views1 answer
Instantiate matrix java
Java
0 vote204 views1 answer
How to add spaces before string in java
Java
0 vote192 views2 answers
How to send gmail using spring boot in java code
Java Spring
7 votes198 views2 answers
Java console text color
Java
0 vote165 views1 answer
List Double, fixed size
Java
0 vote209 views1 answer
Recyclerview scramble after scrolling
Java
3 votes218 views1 answer
Assert system.out.println
Java