思路1:
在三数之和外加一层循环。
时间复杂度:O(n3)
class Solution:
def fourSum(self, nums: List[int], target: int) -> List[List[int]]:
n = len(nums)
if n<4:return []
ans = []
nums.sort() # 前提:有序
for i in range(n-3): # num1,范围[0,n-4]
if i > 0 and nums[i] == nums[i - 1]: # 剪枝:i不重复
continue
for j in range(i+1,n-2): # num2,范围[i+1,n-3]
if j > i+1 and nums[j] == nums[j - 1]: # 剪枝:j不重复
continue
L = j+1 # num3
R = n-1 # num4
while L<R:
delta = nums[i]+nums[j]+nums[L]+nums[R]-target
if delta==0:
ans.append([nums[i],nums[j],nums[L],nums[R]])
while L<R and nums[L+1]==nums[L]:# 剪枝:L不重复
L+=1
while L<R and nums[R-1]==nums[R]:# 剪枝:R不重复
R-=1
L+=1
R-=1
elif delta<0:
L+=1
else:
R-=1
return ans
优化:
增加剪枝条件:
if nums[i]+sum(nums[i+1:i+4])>target:break
, 最小的i都越界,不用考虑了break
if nums[i]+sum(nums[-1:-4:-1])<target:continue
, 最小的j和最大的L,R都不够,后面不用考虑其他L,R,直接换 j,continue
if nums[i]+nums[j]+sum(nums[j+1:j+3])>target:break
if nums[i]+nums[j]+sum(nums[-1:-3:-1])<target:continue
class Solution:
def fourSum(self, nums: List[int], target: int) -> List[List[int]]:
n = len(nums)
if n<4:return []
ans = []
nums.sort() # 前提:有序
for i in range(n-3): # num1,范围[0,n-4]
if i > 0 and nums[i] == nums[i - 1]: continue # 剪枝:i不重复
if nums[i]+sum(nums[i+1:i+4])>target:break
if nums[i]+sum(nums[-1:-4:-1])<target:continue
for j in range(i+1,n-2): # num2,范围[i+1,n-3]
if j > i+1 and nums[j] == nums[j - 1]: continue # 剪枝:j不重复
if nums[i]+nums[j]+sum(nums[j+1:j+3])>target:break
if nums[i]+nums[j]+sum(nums[-1:-3:-1])<target:continue
L = j+1 # num3
R = n-1 # num4
while L<R:
delta = nums[i]+nums[j]+nums[L]+nums[R]-target
if delta==0:
ans.append([nums[i],nums[j],nums[L],nums[R]])
while L<R and nums[L+1]==nums[L]:# 剪枝:L不重复
L+=1
while L<R and nums[R-1]==nums[R]:# 剪枝:R不重复
R-=1
L+=1
R-=1
elif delta<0:
L+=1
else:
R-=1
return ans