454. 4Sum II

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的空间复杂度来换取时间复杂度的减少。最终达到O(N^2)的时间和空间复杂度。

class Solution {
    public int fourSumCount(int[] A, int[] B, int[] C, int[] D) {

        Map<Integer, Integer> cdMap = new HashMap<>();
        int count = 0;
        for(int c : C){
            for(int d : D)
                cdMap.put(c+d, cdMap.getOrDefault(c+d, 0) + 1);
        }
        for(int a : A){
            for(int b : B){
                    if(cdMap.containsKey(-a-b))
                        count = count + cdMap.get(-a-b);
            }
        }
        return count;
    }
}