LeetCode || Hash

class Solution {
public:
    int fourSumCount(vector<int>& A, vector<int>& B, vector<int>& C, vector<int>& D) {
        int na = A.size(), nb = B.size(), nc = C.size(), nd = D.size();
        int cnt = 0;
        map<int, int> mp;
        for (int i = 0; i < na; i++) {
            for (int j = 0; j < nb; j++) {
                int sum = A[i] + B[j];
                if (mp[-sum]) mp[-sum]++;
                else mp[-sum] = 1;
            }
        }
        for (int i = 0; i < nc; i++) {
            for (int j = 0; j < nd; j++) {
                int sum = C[i] + D[j];
                if (mp[sum]) cnt += mp[sum];
            }
        }
        return cnt;
    }
};