/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

21 votes320 views2 answers
Java bubble sort
Java
37 votes309 views4 answers
Queue in java
Java
0 vote312 views1 answer
How to find prime numbers in java
Java
3 votes253 views2 answers
How to split a string space for numbers in java
Java
0 vote304 views1 answer
Javafx listview of objects
Java
0 vote311 views1 answer
How to know what a valid name for a variable is in java
Java
0 vote301 views2 answers
Java draw image
Java
0 vote316 views1 answer
What are construtcor java
Java
1 vote288 views1 answer
String joiner in streams java
Java
0 vote300 views2 answers
Java coding standards for interfaces
Java