leetcode 每日一题之四数相加--小白呕心制作

给定四个包含整数的数组列表 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

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/4sum-ii
先写上我的暴力解法，但是最后超出了时间限制，小白博主非常滴桑心，代码附上：

class Solution(object):
    def fourSumCount(self, A, B, C, D):
        """
        :type A: List[int]
        :type B: List[int]
        :type C: List[int]
        :type D: List[int]
        :rtype: int
        """
        COUNT=0
        n=len(A)
        for i in range(n):
            for j in range(n):
                for k in range(n):
                    for l in range(n):
                        if A[i]+B[j]+C[k]+D[l]==0:
                            COUNT+=1
                        else:
                            pass
        return COUNT

此代码迭代次数过多，超出了时间限制
优化时间复杂度为三个O（n^2）

class Solution(object):
    def fourSumCount(self, A, B, C, D):
        """
        :type A: List[int]
        :type B: List[int]
        :type C: List[int]
        :type D: List[int]
        :rtype: int
        """
        a=[]
        d=[]
        COUNT = 0
        n = len(A)
        for i in range(n):
            for j in range(n):
                b = A[i] + B[j]
                a.append(b)

        for k in range(n):
            for l in range(n):
                c=-C[k]-D[l]
                d.append(c)
        N=len(a)
        for m in range(N):
            for n in range(N):
                if a[m]==d[n]:
                    COUNT+=1
                else:
                    pass
        return COUNT

同样超出时间限制
最后，将AB和CD分为两组求和，然后利用哈希查找

class Solution:
    def fourSumCount(self, A: List[int], B: List[int], C: List[int], D: List[int]) -> int:
        HashA, HashB, HashC, HashD = {}, {}, {}, {}
        for i in range(len(A)):
            HashA[A[i]] = HashA.get(A[i], 0) + 1
            HashB[B[i]] = HashB.get(B[i], 0) + 1
            HashC[C[i]] = HashC.get(C[i], 0) + 1
            HashD[D[i]] = HashD.get(D[i], 0) + 1
        HashAB, HashCD = {}, {}
        for a in HashA.keys():
            for b in HashB.keys():
                ab = a+b
                HashAB[ab] = HashAB.get(ab, 0) + HashA[a]*HashB[b]
        for c in HashC.keys():
            for d in HashD.keys():
                cd = c+d
                HashCD[cd] = HashCD.get(cd, 0) + HashC[c]*HashD[d]
        AB_, CD_ = list(HashAB.keys()), list(HashCD.keys())
        res = 0
        for ab_ in AB_:
            if HashCD.get(-ab_, 0) > 0:
                res += HashAB[ab_]*HashCD[-ab_]
        return res