[leetcode] problem 153 – find minimum in rotated sorted array

public int (int[] nums) {
    int left = 0;
    int right = nums.length - 1;

    while (left < right) {
        int middle = (left + right) >> 1;

        if (nums[middle] > nums[right])
            left = middle + 1;
        else
            right = middle;
    }

    return nums[left];
}