454. 4Sum II**

454. 4Sum II**

https://leetcode.com/problems/4sum-ii/description/

题目描述

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

解题思路

使用一个查找表, 记录 A[i] + B[j] 的和, 然后分析 C 和 D 中元素的和, 判断查找表中是否存在 0 - C[k] - D[l].

C++ 实现 1

lass Solution {
public:
    int fourSumCount(vector<int>& A, vector<int>& B, vector<int>& C, vector<int>& D) {
        // 使用 record 记录 A[i] + B[j] 的和有多少个
        unordered_map<int, int> record;
        for (int i = 0; i < A.size(); ++i)
            for (int j = 0; j < B.size(); ++j)
                record[A[i] + B[j]] ++;

        int res = 0;
        for (int i = 0; i < C.size(); ++i) {
            for (int j = 0; j < D.size(); ++j) {
                auto iter = record.find(0 - C[i] - D[j]);
                if (iter != record.end())
                    res += iter->second;
            }
        }
        return res;
    }
};