LeetCode.No.33 搜索螺旋排序数组
使用二分法class Solution: def search(self, nums: List[int], target: int) -> int: left, right = 0, len(nums) - 1 while left <= right: mid = (left + right) // 2 if nums[mid] == target: retu
