81. 搜索旋转排序数组 II
1.题目
2.我的解决方案
使用python偷懒
class Solution:
def search(self, nums: List[int], target: int) -> bool:
if target in nums:
return True
else:
return False
排序,使用二分查找
class Solution:
def search(self, nums: List[int], target: int) -> bool:
nums.sort()
left = 0
right = len(nums) - 1
while left <= right:
mid = (left+right) // 2
if nums[mid] > target:
right = mid - 1
elif nums[mid] < target:
left = mid + 1
else:
return True
return False
- 时间复杂度:
O
(
n
l
o
g
n
)
O(nlogn)
O(nlogn)
- 空间复杂度:
O
(
1
)
O(1)
O(1)
3.官方的解决方案
class Solution:
def search(self, nums: List[int], target: int) -> bool:
if len(nums) == 1:
return nums[0] == target
left = 0
right = len(nums) - 1
while left <= right:
mid = (left+right) // 2
if nums[mid] == target:
return True
if nums[left] == nums[mid] and nums[mid] == nums[right]:
left += 1
right -= 1
elif nums[left] <= nums[mid]:
if nums[left] <= target < nums[mid]:
right = mid -1
else:
left = mid + 1
else:
if nums[mid] < target <= nums[right]:
left = mid + 1
else:
right = mid - 1
return False
- 时间复杂度:
O
(
n
)
O(n)
O(n)
- 空间复杂度:
O
(
1
)
O(1)
O(1)