[leetcode] 454. 4Sum II @ python

原题

Given four lists A, B, C, D of integer values, compute how many tuples (i, j, k, l) there are such that A[i] + B[j] + C[k] + D[l] is zero.

To make problem a bit easier, all A, B, C, D have same length of N where 0 ≤ N ≤ 500. All integers are in the range of -228 to 228 - 1 and the result is guaranteed to be at most 231 - 1.

Example:

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

Output:
2

Explanation:
The two tuples are:

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

解法

字典, 遍历A和B, 储存A+B的值和计数, 然后遍历C和D, 如果有-c-d在字典中, 说明已找到一个配对, 累加它的计数即可.
Time: O(n**2)
Space: O(n)

代码

class Solution:
    def fourSumCount(self, A: 'List[int]', B: 'List[int]', C: 'List[int]', D: 'List[int]') -> 'int':
        mp = dict()
        for a in A:
            for b in B:
                mp[a+b] = mp.get(a+b, 0) + 1
        count = 0
        for c in C:
            for d in D:
                if -c-d in mp:
                    count += mp[-(c+d)]
        return count