1.第一题:
直接法,不行看来我还是该看点算法书了,这样下去没前途!!!
class Solution:
def containsDuplicate(self, nums: List[int]) -> bool:
if nums ==[]:
return False
nums=sorted(nums)
key=nums[0]
for i in range(1,len(nums)):
if nums[i]==key:
return True
else:
key=nums[i]
return False
2.第二题:
最后一个测试用例超时:
class Solution:
def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:
for i in range(len(nums)):
j=len(nums)-1
if j-i>k:
j=i+k
while j>i:
if nums[i]==nums[j]:
return True
j-=1
return False
不超时的版本,若nums中没有重复值则直接返回False,减小将整个nums遍历完的情况,代码如下:
class Solution:
def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:
if len(set(nums))==len(nums):
return False
i=0
while i<len(nums):
a=nums[i+1:i+1+k]
if nums[i] in a:
return True
i+=1
return False