leetcode 153 Find Minimum in Rotated Sorted Array（寻找旋转排序数组中的最小值） python3 最简二分发细节处理

class Solution:
    def findMin(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        # method one
        # return min(nums)

        # method two: 二分法
        left, right = 0, len(nums)-1
        while left < right:
            mid = left + (right - left) // 2  # 地板除，舍去小数部分
            if nums[mid] < nums[right]:       # 移动右边显然是更安全的选择
                right = mid
            else:
                left = mid + 1
        return nums[left]