[leetcode] 454. 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

分析

• 这道题的暴力解法当然是几个大循环来做，时间复杂度为O(n^4)
• 我们来看看O(n^2)的解法：如果把A和B的两两之和都求出来，在哈希表中建立两数之和跟其出现次数之间的映射，那么我们再遍历C和D中任意两个数之和，我们只要看哈希表存不存在这两数之和的相反数就行了。

代码

class Solution {
public:
    int fourSumCount(vector<int>& A, vector<int>& B, vector<int>& C, vector<int>& D) {
        unordered_map<int,int> m;
        for(int i=0;i<A.size();i++){
            for(int j=0;j<B.size();j++){
                m[A[i]+B[j]]++;
            }
        }
        int res=0;
        for(int i=0;i<C.size();i++){
            for(int j=0;j<D.size();j++){
                int target=-(C[i]+D[j]);
                res+=m[target];
            }
        }
        return res;
    }
};

参考文献

[LeetCode] 4Sum II 四数之和之二