4Sum II

https://leetcode.com/submissions/detail/153740275/

class Solution {
public:
    int fourSumCount(vector<int>& A, vector<int>& B, vector<int>& C, vector<int>& D) {
        unordered_map<int,int> CD_freq;
        for (auto i : C)
            for (auto j : D)
                CD_freq[i+j]++;

        int res = ;
        for (auto a : A)
            for (auto b : B) {
                auto it = CD_freq.find(-(a+b));
                if (it != CD_freq.end())
                    res += it->second;
            }
        return res;
    }
    int fourSumCount(vector<int>& A, vector<int>& B, vector<int>& C, vector<int>& D) {
        unordered_map<int,int> CD_freq;
        for (auto i : C)
            for (auto j : D)
                CD_freq[i+j]++;

        int res = ;
        for (auto a : A)
            for (auto b : B)
                res += CD_freq[-(a + b)];　　// If CD_freq[-(a+b)] doesn't exist, it will be added! So map becomes much bigger!!!
        return res;
    }
    int fourSumCount_n3(vector<int>& A, vector<int>& B, vector<int>& C, vector<int>& D) {
        unordered_map<int,int> D_freq;
        for (auto i : D)
            D_freq[i]++;

        int res = ;
        for (int i = ; i < A.size(); i++)
            for (int j = ; j < B.size(); j++)
                for (int k = ; k < C.size(); k++)
                    res += D_freq[-(A[i] + B[j] + C[k])];
        return res;
    }
    int fourSumCount_n4(vector<int>& A, vector<int>& B, vector<int>& C, vector<int>& D) {
        int res = ;
        for (int i = ; i < A.size(); i++)
            for (int j = ; j < B.size(); j++)
                for (int k = ; k < C.size(); k++)
                    for (int l = ; l < D.size(); l++)
                        if (A[i] + B[j] + C[k] + D[l] == )
                            res++;
        return res;
    }
};