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 vote215 views1 answer
Java array hashcode
Java
0 vote183 views2 answers
Highlight text in android studio
Java
0 vote251 views1 answer
Spring yml property boolean
Java Spring
0 vote191 views1 answer
Creating new objects from loop java
Java
0 vote242 views1 answer
Configuration spring boot dependency for freemarker configuration
Java Spring
1 vote229 views2 answers
What is local variable in java
Java
0 vote211 views1 answer
Java create date object from yesterday
Java
0 vote191 views1 answer
Java Maven Using platform encoding (UTF-8 actually) to read mojo metadata, i.e. build is platform dependent!
Java
1 vote209 views1 answer
Spigot API inventory close
Java
0 vote245 views1 answer
Java spring boot json deserialize date inaccurate
Java Spring