/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 vote249 views1 answer
Splash full screen android
Java
0 vote298 views1 answer
Tutorialedge working with docker
Java
2 votes315 views10 answers
Java
Java
1 vote269 views1 answer
Get boolean from string java
Java
0 vote259 views1 answer
Tableau de chaîne de caractère en java
Java
2 votes279 views1 answer
Java read last line of file
Java
0 vote272 views1 answer
Bukkit console filter
Java
7 votes252 views1 answer
How to reverse order of arraylist
Java
-3 votes296 views1 answer
Www.codecademy.com
Java
2 votes265 views1 answer
Java math.pi
Java