[leetcode]454. 4Sum II

题目链接：https://leetcode.com/problems/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

class Solution{
public:
    int fourSumCount(vector<int>& A,vector<int>& B,vector<int>& C,vector<int>& D)
    {
        if(A.size()==0)
            return 0;
        int count=0;
        unordered_map<int,int> map1,map2;
        for(auto a:A)
            for(auto b:B)
                map1[a+b]++;
        for(auto c:C)
            for(auto d:D)
                map2[c+d]++;
        for(auto m1:map1)
        {
            int target=m1.first;
            if(map2.find(-target)!=map2.end())
                count+=m1.second*map2[-target];
        }
        return count;
    }
};