/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 vote242 views1 answer
Javax dependency android
Java
28 votes199 views6 answers
Java get current date
Java
6 votes214 views1 answer
Best IDE for java
Java
0 vote197 views1 answer
Procedural programming Java code example
Java
0 vote198 views1 answer
Java code for logarithm
Java
2 votes199 views1 answer
Java string vs stringbuilder
Java
9 votes203 views3 answers
Read file in java
Java
5 votes166 views4 answers
Cors spring boot
Java
0 vote194 views1 answer
How to install java jdk 8 on ubuntu 20.04 for spark
Java
4 votes195 views1 answer
Shift elements in array java
Java