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 vote200 views2 answers
Java coding standards for interfaces
Java
0 vote145 views1 answer
Antialiasing kjava
Java
0 vote193 views1 answer
Betrag absolute abs java
Java
19 votes208 views6 answers
Flutter padding
Java
12 votes172 views3 answers
Smart ways to print a matrix in java
Java
0 vote148 views1 answer
Java data table source tymeLeaf
Java
0 vote224 views1 answer
Python to java converter software
Java
0 vote153 views1 answer
Make the array stop in java
Java
1 vote167 views1 answer
Pycharm qt designer
Java
76 votes158 views3 answers
Java split string by length
Java