T1:leetcode.454 四数相加Ⅱ
class Solution {
public:
int fourSumCount(vector<int>& A, vector<int>& B, vector<int>& C, vector<int>& D) {
unordered_map<int, int> umap;
int count = 0;
for (int a : A) {
for (int b : B) {
umap[a + b]++;
}
}
for (int c : C) {
for (int d : D) {
if (umap.find(0 - (c + d)) != umap.end()) {
count += umap[0 - (c + d)];
}
}
}
return count;
}
};
/*
1.unordered_map存储数以及出现次数 用<int, int>
*/