':type nums: List[int]
:rtype: int'

def findMin(self, nums):

    (left, right) = (0, len(nums))
    target = nums[(-1)]
    while (left < right):
        mid = (left + ((right - left) / 2))
        if (nums[mid] <= target):
            right = mid
        else:
            left = (mid + 1)
    return nums[left]
