题目:
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.
这道题数组size最大可以到500.如果直接暴力求解肯定会超时,因此必须使用一些其他的结构或者算法,我加入了一个map,时间为O(n*n)的算法。就是保存两个的结果,然后再用另外两个的结果来比较。
class Solution {
map<int, int>matrix;
int count = 0;
public:
int fourSumCount(vector<int>& A, vector<int>& B, vector<int>& C, vector<int>& D) {
if(A.size() < 1)return 0;
for(int i=0; i<A.size();i++)
for(int j=0; j<B.size();j++)
matrix[A[i] + B[j]]++;
for(int i=0; i<C.size();i++)
for(int j=0; j<D.size();j++)
if(matrix[-(C[i] + D[j])] > 0)
count += matrix[-(C[i] + D[j])];
return count;
}
};