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
起初并不知道 有什么简单的方法,只知道 暴力解题,四层循环下来 果不其然超时了
后来看了别人的做法,用了hashmap来做,key保存两个数组的和,value保存出现该和的个数,然后如果另外两个数组的和等于这个hashmap的-key,就加上value的值。
public class Solution {
public int fourSumCount(int[] A, int[] B, int[] C, int[] D) {
Map<Integer,Integer> map = new HashMap<Integer,Integer>();
int n = A.length;
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
map.put(A[i]+B[j],map.getOrDefault(A[i]+B[j],0)+1);
}
}
int count = 0;
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
count+=map.getOrDefault(-C[i]-D[j],0);
}
}
return count;
}
}
这里面Object getOrDefault(Object key, Object defaultValue),表示返回map键对应的map值,如果不存在map键,返回默认值。