Pivot in 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

3 votes132 views2 answers
How to get the max value of an array java
Java
0 vote163 views1 answer
Spring aop xml definition
Java Spring
0 vote130 views1 answer
Laravel Please update to at least Node v12.14
Java
50 votes131 views4 answers
How to find last element in array java
Java
19 votes142 views2 answers
How to make a loop in java
Java
0 vote151 views1 answer
How-to-check-internet-connection-in-android
Java
0 vote227 views5 answers
Android multiimage view
Java
0 vote179 views1 answer
How to open a desktop application using java
Java
1 vote147 views1 answer
MCQ java
Java
4 votes147 views1 answer
Rates api
Java