[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 -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

给定四个数组，从每个数组中取出一个元素，求四个元素相加和为零的组合共有多少种，思路是将四个数组，两两求two-sum 的所有情况使用hash-table 存储。最后遍历hash-table 计算满足4 sum的组合个数。时间复杂度是$O(N^2)$

C++ 代码

class Solution {
public:
    int fourSumCount(vector<int>& A, vector<int>& B, vector<int>& C, vector<int>& D) {
        unordered_map<int,int> A_plus_B(A.size() * A.size());
        unordered_map<int,int> C_plus_D(C.size() * C.size());

        const auto calculate_2_sum = [] (const vector<int>& vec1,
                                         const vector<int>& vec2,
                                         unordered_map<int,int>& plus)
        {
            for (const auto val1 : vec1)
            {
                for (const auto val2 : vec2)
                {
                    plus[val1 + val2]++;
                }
            }
        };

        calculate_2_sum(A, B, A_plus_B);
        calculate_2_sum(C, D, C_plus_D);

        int res = 0;
        for (const auto a_plus_b : A_plus_B)
        {
            if(C_plus_D.count(-a_plus_b.first))
            {
                res += a_plus_b.second * C_plus_D[-a_plus_b.first];
            }
        }
        return res;
    }
};