LeetCode Solutions/Binary Search Study Plan/Binary Search I/Find Minimum in Rotated Sorted Array.java
class Solution {
    public int findMin(int[] nums) {
        int left=0, right=nums.length-1;
        while(left < right){
            int mid = left+(right-left)/2;
            if(nums[mid] < nums[right]){
                right = mid;
            } else{
                left = mid+1;
            }
        }
        return nums[left];
    }
}