Given an array nums
of n integers and an integer target
, are there elements a, b, c, and d in nums
such that a + b + c + d = target
? Find all unique quadruplets in the array which gives the sum of target
.
Note:
The solution set must not contain duplicate quadruplets.
Example:
Given array nums = [1, 0, -1, 0, -2, 2], and target = 0. A solution set is: [ [-1, 0, 0, 1], [-2, -1, 1, 2], [-2, 0, 0, 2] ]
先后尝试了三种方法,前两种都是Time Limit Exceeded,主要还是嵌套循环增加了运行的时间复杂度
第三种方法是通过字典去遍历
1.获取所有s=nums[i]+nums[j]相加的可能值,放入numdic中,数据格式为{[s : [i , j] ]}
2.将s=nums[i]+nums[j] 实现target需要的number配合i 和 j 放入slist中,数据格式为[i,j,target-s]
3.根据slist中的target-s在numdic中查找符合key=target-s的内容
class Solution(object):
def fourSum(self, nums, target):
"""
:type nums: List[int]
:type target: int
:rtype: List[List[int]]
"""
if len(nums)<4:
return []
nums.sort()
numdic={}
slist=[]
rlist=[]
for i in range(len(nums)-1):
for j in range(i+1,len(nums)):
s=nums[i]+nums[j]
ms=target-s
slist.append([i,j,ms])
if numdic.has_key(s)==False:
numdic[s]=[]
numdic[s].append([i,j])
k=0
while k<len(slist)-1:
key=slist[k][2]
if numdic.has_key(key)==False:
k+=1
continue
l=numdic[key]
m=0
while m<len(l):
if slist[k][0] in [numdic[key][m][0],numdic[key][m][1]] or slist[k][1] in [numdic[key][m][0],numdic[key][m][1]]:
m+=1
continue
rlist.append(sorted([nums[slist[k][0]],nums[slist[k][1]],nums[numdic[key][m][0]],nums[numdic[key][m][1]]]))
m+=1
k+=1
temp_set = set(tuple(s) for s in rlist)
new_list = [list(t) for t in temp_set]
return new_list