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.
Example:
Input: A = [ 1, 2] B = [-2,-1] C = [-1, 2] D = [ 0, 2] Output: 2 Explanation: The two tuples are: 1. (0, 0, 0, 1) -> A[0] + B[0] + C[0] + D[1] = 1 + (-2) + (-1) + 2 = 0 2. (1, 1, 0, 0) -> A[1] + B[1] + C[0] + D[0] = 2 + (-1) + (-1) + 0 = 0
Subscribe to see which companies asked this question.
【思路】 使用两个map 时间复杂度为 O(N^2)
class Solution {
public:
int fourSumCount(vector<int>& A, vector<int>& B, vector<int>& C, vector<int>& D) {
int n = A.size();
if(n==0) return 0;
unordered_map<int,int> map1;
unordered_map<int,int> map2;
for(int i =0;i<n;i++){
for(int j = 0;j<n;j++){
int add =A[i]+B[j];
map1[add]++;
}
}
for(int i =0;i<n;i++){
for(int j = 0;j<n;j++){
int add =C[i]+D[j];
map2[add]++;
}
}
int count =0;
for(auto it =map1.begin();it!=map1.end();it++){
int target = it ->first;
if(map2.find(-target)!= map2.end()) count = count + map1[target]*map2[-target];
}
return count;
}
};