Leetcode 454. 四数相加 II(Python3)

454. 四数相加 II

给定四个包含整数的数组列表 A , B , C , D ,计算有多少个元组 (i, j, k, l) ，使得 A[i] + B[j] + C[k] + D[l] = 0。

为了使问题简单化，所有的 A, B, C, D 具有相同的长度 N，且 0 ≤ N ≤ 500 。所有整数的范围在 -228 到 228 - 1 之间，最终结果不会超过 231 - 1 。

例如:

输入:
A = [ 1, 2]
B = [-2,-1]
C = [-1, 2]
D = [ 0, 2]

输出:
2

解释:
两个元组如下:
1. (0, 0, 0, 1) -> A[0] + B[0] + C[0] + D[1] = 1 + (-2) + (-1) + 2 = 0
2. (1, 1, 0, 0) -> A[1] + B[1] + C[0] + D[0] = 2 + (-1) + (-1) + 0 = 0

---

class Solution:
    def fourSumCount(self, A: List[int], B: List[int], C: List[int], D: List[int]) -> int:
        #思路来自小饭盆
        def two_merge(n1,n2):
            d = {}
            for i in n1:
                for j in n2:
                    tmp = i + j
                    d[tmp] = d.get(tmp,0) + 1
            return d
        
        ab = two_merge(A,B)
        cd = two_merge(C,D)
        cnt = 0
        
        for i in ab:
            if 0 - i in cd:
                cnt += ab[i] * cd[0 - i]
                                  
        return cnt

---

class Solution:
    def fourSumCount(self, A: List[int], B: List[int], C: List[int], D: List[int]) -> int:
        dic = {}
        cnt = 0

        for a in A:
            for b in B:
                dic[a+b] = dic.get(a+b,0) + 1
                
        for c in C:
            for d in D:
                cnt += dic.get(-c-d,0)
                                  
        return cnt