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

0 vote148 views1 answer
Spring core xml configuration for collection using constructor
Java
0 vote132 views1 answer
Spinner get items
Java
0 vote179 views5 answers
Deal with empty or blank cell in excel file using apache poi
Java
0 vote142 views1 answer
Java how to get all threads
Java
0 vote125 views1 answer
Android get app build name
Java
1 vote138 views1 answer
How to install java 8 on aws linux
Java
0 vote163 views1 answer
How to get a set from a map in java
Java
0 vote138 views1 answer
How to return string in java
Java
1 vote144 views1 answer
Factorial of a number using recursion in java
Java
0 vote159 views1 answer
Java spring boot json deserialize date inaccurate
Java Spring