题解 | #旋转数组的最小数字#
旋转数组的最小数字
https://www.nowcoder.com/practice/9f3231a991af4f55b95579b44b7a01ba
# # 代码中的类名、方法名、参数名已经指定,请勿修改,直接返回方法规定的值即可 # # # @param nums int整型一维数组 # @return int整型 # class Solution: def minNumberInRotateArray(self, nums: List[int]) -> int: self.nums = nums left = 0 right = len(nums) - 1 while left <= right: mid = (left + right) // 2 print(left) if left == right: return nums[mid] elif nums[0] < nums[len(nums)-1]: return nums[0] elif nums[mid] > nums[mid + 1]: return nums[mid + 1] elif nums[mid] <= nums[0]: right = mid else: left = mid return False