153.查找旋转数组中最小数

class Solution(object):
    def findMin(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        n = len(nums)
        if n == 0:
            return -1
        if n == 1:
            return nums
        if nums[0]<nums[n-1]:
            return nums[0]
        elif nums[0]>nums[n-1]:
            left = 0
            right = n-1
            while left < right:
                mid = int((left+right)/2)
                if nums[mid]>nums[right]:
                    left = mid + 1
                elif nums[mid]<nums[right]:
                    right = mid
                else:
                    right -= 1
            return nums[left]
        else:
            minn = nums[0]
            for i in range(n):
                if minn>nums[i]:
                    minn = nums[i]
            return minn