# 给你一个由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
class Solution(object):
def fourSum(self, nums, target):
"""
:type nums:List[int]
:type target:int
:rtype:List[List[int]]
"""
num_l = len(nums)
res = []
if num_l < 4:
return res
nums.sort()
for i in range(num_l - 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[num_l - 1] + nums[num_l - 2] + nums[num_l - 3] < target:
continue
for j in range(i + 1, num_l - 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[num_l - 1] + nums[num_l - 2] < target:
continue
l, r = j + 1, num_l - 1
while l < r:
if nums[i] + nums[j] + nums[l] + nums[r] == target:
res.append([nums[i], nums[j], nums[l], nums[r]])
while l < r and nums[l] == nums[l + 1]:
l += 1
while l < r and nums[r] == nums[r - 1]:
r -= 1
l += 1
r -= 1
elif nums[i] + nums[j] + nums[l] + nums[r] > target:
r -= 1
else:
l += 1
return res
if __name__ == '__main__':
solution = Solution
num = solution.fourSum(solution, [1, 0, -1, 0, -2, 2], target=0)
print(num)
num = solution.fourSum(solution, nums=[2, 2, 2, 2, 2], target=8)
print(num)
# 输出结果:
[[-2, -1, 1, 2], [-2, 0, 0, 2], [-1, 0, 0, 1]]
[[2, 2, 2, 2]]