1. 题目
给你一个由 n n n 个整数组成的数组 n u m s nums nums,和一个目标值 t a r g e t target target。请你找出并返回满足下述全部条件且不重复的四元组 [ n u m s [ a ] , n u m s [ b ] , n u m s [ c ] , n u m s [ d ] ] [nums[a], nums[b], nums[c], nums[d]] [nums[a],nums[b],nums[c],nums[d]] (若两个四元组元素一一对应,则认为两个四元组重复):
- 0 < = a , b , c , d < n 0 <= a, b, c, d < n 0<=a,b,c,d<n
- a 、 b 、 c a、b、c a、b、c 和 d d d 互不相同
- n u m s [ a ] + n u m s [ b ] + n u m s [ c ] + n u m s [ d ] = = t a r g e t nums[a] + nums[b] + nums[c] + nums[d] == target nums[a]+nums[b]+nums[c]+nums[d]==target
你可以按 任意顺序 返回答案 。
示例 1:
输入:
n
u
m
s
=
[
1
,
0
,
−
1
,
0
,
−
2
,
2
]
,
t
a
r
g
e
t
=
0
nums = [1,0,-1,0,-2,2], target = 0
nums=[1,0,−1,0,−2,2],target=0
输出:
[
[
−
2
,
−
1
,
1
,
2
]
,
[
−
2
,
0
,
0
,
2
]
,
[
−
1
,
0
,
0
,
1
]
]
[[-2,-1,1,2],[-2,0,0,2],[-1,0,0,1]]
[[−2,−1,1,2],[−2,0,0,2],[−1,0,0,1]]
示例 2:
输入:
n
u
m
s
=
[
2
,
2
,
2
,
2
,
2
]
,
t
a
r
g
e
t
=
8
nums = [2,2,2,2,2], target = 8
nums=[2,2,2,2,2],target=8
输出:
[
[
2
,
2
,
2
,
2
]
]
[[2,2,2,2]]
[[2,2,2,2]]
提示:
- 1 < = n u m s . l e n g t h < = 200 1 <= nums.length <= 200 1<=nums.length<=200
- − 1 0 9 < = n u m s [ i ] < = 1 0 9 -10^9 <= nums[i] <= 10^9 −109<=nums[i]<=109
- − 1 0 9 < = t a r g e t < = 1 0 9 -10^9 <= target <= 10^9 −109<=target<=109
2. 思路及代码实现(Python)
2.1 排序 + 双指针
这个题目类似于《LeetCode_2_中等_两数相加》《LeetCode_15_中等_三数之和》,这两篇文章的方法都是先对数组的值进行排序后,存储一个哈希字典来加快最后两个数的搜索。
为了避免枚举到重复的四元组,可以对数组的元素进行排序。对于四数之和为定值的问题,双指针可以节省一层的循环。算法的时间复杂度为 O ( n 3 ) O(n^3) O(n3),空间复杂度为u O ( n ) O(n) O(n)。
class Solution:
def fourSum(self, nums: List[int], target: int) -> List[List[int]]:
quadruplets = list()
if not nums or len(nums) < 4:
return quadruplets
nums.sort()
length = len(nums)
for i in range(length - 3):
if i > 0 and nums[i] == nums[i - 1]:
continue
if nums[i] + nums[i + 1] + nums[i + 2] + nums[i + 3] > target:
break
if nums[i] + nums[length - 3] + nums[length - 2] + nums[length - 1] < target:
continue
for j in range(i + 1, length - 2):
if j > i + 1 and nums[j] == nums[j - 1]:
continue
if nums[i] + nums[j] + nums[j + 1] + nums[j + 2] > target:
break
if nums[i] + nums[j] + nums[length - 2] + nums[length - 1] < target:
continue
left, right = j + 1, length - 1
while left < right:
total = nums[i] + nums[j] + nums[left] + nums[right]
if total == target:
quadruplets.append([nums[i], nums[j], nums[left], nums[right]])
while left < right and nums[left] == nums[left + 1]:
left += 1
left += 1
while left < right and nums[right] == nums[right - 1]:
right -= 1
right -= 1
elif total < target:
left += 1
else:
right -= 1
return quadruplets
执行用时:52 ms
消耗内存:16.42 MB
参考来源:力扣官方题解