# LeetCode 454. 4Sum II

### 题目描述

• 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 -2^28 to 2^28 - 1 and the result is guaranteed to be at most 2^31 - 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

### 问题分析

• 若四层循环遍历四个数组，这样是 O(N^4),超时
• 若将一个数组装入map,然后三层循环遍历三个数组，再去根据和去查表，O(N^3),超时
• 注意题干所给数据，500，所以要求设计的算法一定是 小于 O(N^3)的。
• 正确做法，两层循环遍历 C,D，将所有可能的和放入map，并统计次数，然后两层遍历 A，B，再去查表即可。 O(N^2)

### 经验教训

• 如何根据数据规模推算出所要设计的算法时间复杂度的上限

### 代码实现

class Solution {
public int fourSumCount(int[] A, int[] B, int[] C, int[] D) {
if (A== null || B == null || C == null || D == null || A.length == 0 || B.length == 0 || C.length == 0 || D.length == 0) {
return 0;
}
//将C与D的所有可能组合装入map中
HashMap<Integer, Integer> map = new HashMap<>();
for (int numC : C) {
for (int numD : D) {
map.put(numC + numD, map.getOrDefault(numC + numD, 0) + 1);
}
}
int res = 0;
//遍历A,B,看在map中能否找到相应的组合，使四个数相加为0
for (int numA : A) {
for (int numB : B) {
res +=  map.getOrDefault(0 - numA - numB, 0);
}
}
return res;
}
}