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 vote189 views1 answer
Java class in dataweave
Java
0 vote147 views1 answer
How to hide complete layout in xml android studio
Java
3 votes142 views1 answer
Java number
Java
0 vote192 views1 answer
SpringBootStarter maven dependency
Java
0 vote248 views1 answer
Print zpl from java
Java
1 vote194 views1 answer
Final method meaning
Java
0 vote189 views2 answers
Downcasting in java
Java
0 vote197 views1 answer
How to make a string alphabetic
Java
0 vote238 views1 answer
Test thrown expected with jupiter spring boot
Java Spring
0 vote191 views1 answer
Map - counting with map
Java