/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

16 votes322 views2 answers
Creating buttons in javascript
Java
0 vote348 views1 answer
How to open material navigation view on button click
Java
0 vote359 views1 answer
Javafx how to change shape color
Java
-1 vote335 views1 answer
Java remove punctuation from string
Java
2 votes364 views2 answers
How to replace a character with another character in a string in java
Java
0 vote371 views1 answer
Echo java
Java
12 votes351 views3 answers
Cardview implementation
Java
0 vote367 views1 answer
Java script find screen size of device
Java
2 votes351 views2 answers
Install java with brew
Java
0 vote362 views2 answers
Material design implement full screen dialog android java
Java