-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathfourSum.py
More file actions
78 lines (58 loc) · 2.1 KB
/
Copy pathfourSum.py
File metadata and controls
78 lines (58 loc) · 2.1 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
# -*- encoding: utf-8 -*-
'''
@project : LeetCode
@File : fourSum.py
@Contact : 9824373@qq.com
@Desc :
给定一个包含 n 个整数的数组 nums 和一个目标值 target,判断 nums 中是否存在四个元素 a,b,c 和 d ,使得 a + b + c + d 的值与 target 相等?找出所有满足条件且不重复的四元组。
注意:
答案中不可以包含重复的四元组。
示例:
给定数组 nums = [1, 0, -1, 0, -2, 2],和 target = 0。
满足要求的四元组集合为:
[
[-1, 0, 0, 1],
[-2, -1, 1, 2],
[-2, 0, 0, 2]
]
@Modify Time @Author @Version @Desciption
------------ ------- -------- -----------
2020-03-18 zhan 1.0 None
'''
from typing import List
class Solution:
def fourSum(self, nums: List[int], target: int) -> List[List[int]]:
if len(nums) <4: return []
nums.sort()
ans = self.dfs(nums,target,depth=1,prefix=[])
return ans
def dfs(self,nums,target,depth,prefix):
ans = []
if depth == 4:
for num in nums:
if num == target:
tmp = prefix[:]
tmp.append(num)
ans.append(tmp)
# 保证不重复,最后一层只返回一个即可
return ans
return ans
else:
curNums = nums[:]
for i, num in enumerate(nums):
curNums.remove(num)
if i>=1 and num == nums[i-1]:
continue
curTarget = target - num
curPrefix = prefix[:]
curPrefix.append(num)
ans += self.dfs(curNums,curTarget,depth+1,curPrefix)
return ans
if __name__ == '__main__':
nums = [1, 0, -1, 0, -2, 2]
nums = [-3, -2, -1, 0, 0, 1, 2, 3]
target = 0
nums = [5, 5, 3, 5, 1, -5, 1, -2]
target = 4
ans = Solution().fourSum(nums,target)
print(ans)