题目描述
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.
给定ABCD四个整形数组,计算存在多少中(i,j,k,l)的组合使得A[i] + B[j] + C[k] + D[l] 为0。
ABCD的长度0≤N≤500,所有整数都在-2^28到2^28-1之间,结果最大不超过2^31-1
分析
如果遍历四个数组中所有的ijkl组合,时间复杂度为O(n^4)。这个复杂度显然是不能接受的。使用哈希表,遍历CD两个数组所有二元组的和并添加到一个查找表中,key为二元组的和,value为该值出现的次数。在遍历AB中的二元组A[i]+B[j],在表中查找是否存在-A[i]-B[j]即可
代码
public int fourSumCount(int[] A, int[] B, int[] C, int[] D) {
Map<Integer,Integer> map = new HashMap<>();
for (int i = 0; i < C.length; i++) {
for (int j = 0; j < D.length; j++) {
if (map.containsKey(C[i]+D[j])){
map.put(C[i]+D[j],map.get(C[i]+D[j])+1);
}
else {
map.put(C[i]+D[j],1);
}
}
}
int res = 0;
for (int i = 0; i < A.length; i++) {
for (int j = 0; j < B.length; j++) {
if (map.containsKey(-A[i]-B[j])){
res+=map.get(-A[i]-B[j]);
}
}
}
return res;
}