难度中等1092收藏分享切换为英文接收动态反馈
给你一个由 n
个整数组成的数组 nums
,和一个目标值 target
。请你找出并返回满足下述全部条件且不重复的四元组 [nums[a], nums[b], nums[c], nums[d]]
(若两个四元组元素一一对应,则认为两个四元组重复):
0 <= a, b, c, d < n
a
、b
、c
和d
互不相同nums[a] + nums[b] + nums[c] + nums[d] == target
你可以按 任意顺序 返回答案 。
示例 1:
输入:nums = [1,0,-1,0,-2,2], target = 0 输出:[[-2,-1,1,2],[-2,0,0,2],[-1,0,0,1]]
示例 2:
输入:nums = [2,2,2,2,2], target = 8 输出:[[2,2,2,2]]
提示:
1 <= nums.length <= 200
-109 <= nums[i] <= 109
-109 <= target <= 109
三数之和用双指针解法,一层for循环num[i]为确定值,然后循环内有left和right下标作为双指针,找到nums[i] + nums[left] + nums[right] == 0。四数之和也用双指针解法,只是比三数之和多了一层for循环,即两层for循环nums[i] + nums[j]为确定值,依然是循环内有left和right下标作为双指针,找出nums[i] + nums[j] + nums[left] + nums[right] == target的情况。三数之和的时间复杂度是O(n^2),四数之和的时间复杂度是O(n^3)。
三数之和:https://blog.csdn.net/Gordennizaicunzai/article/details/113487339
class Solution(object):
def fourSum(self, nums, target):
"""
:type nums: List[int]
:type target: int
:rtype: List[List[int]]
"""
nums.sort()
counts = len(nums)
res = list()
for i in range(counts):
if (i > 0) and nums[i] == nums[i-1]:
continue
for j in range(i+1, counts):
if j > i + 1 and nums[j] == nums[j-1]:
continue
left = j + 1
right = counts - 1
while left < right:
if nums[i] + nums[j] + nums[left] + nums[right] < target:
left += 1
elif nums[i] + nums[j] + nums[left] + nums[right] > target:
right -= 1
else:
res.append([nums[i], nums[j], nums[left], nums[right]])
while (left < right) and (nums[left] == nums[left+1]):
left += 1
while (left < right) and (nums[right] == nums[right-1]):
right -= 1
left += 1
right -= 1
return res