/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 vote350 views1 answer
Reponse entity as result spring controller
Java
32 votes360 views2 answers
Check jdk version windows 10 cmd
Java
0 vote359 views2 answers
Registry
Java
2 votes350 views3 answers
String to localdate in java
Java
0 vote363 views3 answers
Slicing array in java
Java
0 vote380 views3 answers
Test function that call a function javascrip
Java
11 votes314 views1 answer
Change spring boot port
Java
0 vote441 views2 answers
Spring boot send email html template
Java Spring
1 vote365 views1 answer
How to add elements to an array in java dynamically
Java
2 votes391 views1 answer
Java set value of arraylist
Java