[leetcode]454. 4Sum II

[leetcode]454. 4Sum II

---

Analysis

等国庆！！！！！—— [嘻嘻~]

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.
把四个数组分成两部分，比如先求出A和B中元素相加的所有组合，然后再遍历C和D，如果C和D中某两个元素相加后的相反数可以在A和B相加的组合中找到，那么就把该组合的个数加到res里面。

Implement

class Solution {
public:
    int fourSumCount(vector<int>& A, vector<int>& B, vector<int>& C, vector<int>& D) {
        unordered_map<int, int> mmp;
        int len = A.size();
        int res = 0;
        for(auto a:A){
            for(auto b:B){
                if(mmp.find(a+b) == mmp.end())
                    mmp[a+b] = 1;
                else
                    mmp[a+b]++;
            }
        }
        for(auto c:C){
            for(auto d:D){
                int tmp = (c+d)*-1;
                if(mmp.count(tmp)){
                    res += mmp[tmp];
                }
            }
        }
        return res;
    }
};