/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

3 votes154 views1 answer
How to convert primitive int to Integer in java
Java
2 votes263 views1 answer
Spring boot resource optional request param
Java Spring
6 votes138 views2 answers
++i vs i++ java
Java
10 votes250 views2 answers
Change the default port in spring boot codegrepper
Java
3 votes141 views1 answer
Keytool command sha256
Java
44 votes133 views5 answers
Iterate hashmap java
Java
0 vote149 views1 answer
Lists - removing
Java
2 votes142 views2 answers
How to set background color in jframe in java
Java
0 vote155 views1 answer
Mongorepository spring boot custom query
Java
5 votes132 views1 answer
Exit from jshell
Java