输入:nums1 = [1,2], nums2 = [-2,-1], nums3 = [-1,2], nums4 = [0,2]
输出:2
解释:
两个元组如下:
1. (0, 0, 0, 1) -> nums1[0] + nums2[0] + nums3[0] + nums4[1] = 1 + (-2) + (-1) + 2 = 0
2. (1, 1, 0, 0) -> nums1[1] + nums2[1] + nums3[0] + nums4[0] = 2 + (-1) + (-1) + 0 = 0
思路:
先把nums1和nums2里的数字各自相加:
nums1 = [1, 2]
nums2 = [-2, -1]
nums1_2 = [-1, 0, 0, 1]
字典统计加和之后,每个数字出现的次数
d = {-1: 1, 0: 2, 1: 1}
初始化count
把nums3, nums4里的数字加和,key = -(n3+n4)
如果在d里出现了-(n3+n4),那么count = count + d[key] (d[key]代表 -(n3+n4)出现的次数)
class Solution:
def fourSumCount(self, nums1: List[int], nums2: List[int], nums3: List[int], nums4: List[int]) -> int:
d = {}
for n1 in nums1:
for n2 in nums2:
if n1+n2 in d:
d[n1+n2] = d[n1+n2] + 1
else:
d[n1+n2] = 1
count = 0
for n3 in nums3:
for n4 in nums4:
if -(n3+n4) in d:
count = count + d[-(n3+n4)]
return count