Sum—LeetCode-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 -2^28 to 2^28 - 1 and the result is guaranteed to be at most 2^31 - 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

思路：没有想到巧妙的方法，第一感觉就是并行处理，两个数组分开求和，借助于HashMap来实现，刚开始想保存每两个数组求和得到的结果，发现结果超时！改进下，只需要维持一个结果HashMap就可以了，参见代码：

public int fourSumCount(int[] A, int[] B, int[] C, int[] D) {
        int count = 0;
        int n = A.length;
        HashMap<Integer, Integer> map = new HashMap<>();
        for(int i = 0; i < n; ++i){
            for(int j = 0; j < n; ++j){
                int tempSum = A[i] + B[j];
                Integer tempValue = map.get(tempSum);
                if(null == tempValue){
                    map.put(tempSum, 1);
                } else {
                    map.put(tempSum, tempValue + 1);
                }
            }
        }

        for(int p = 0; p < n; ++p){
            for(int q = 0; q < n; ++q){
                int tempSum = (C[p] + D[q]) * (-1);
                Integer tempValue = map.get(tempSum);
                if(null != tempValue) {
                    count += tempValue;
                }
            }
        }
        return count;
    }