4Sum
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 the problem a bit easier, all A, B, C, D have the 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
看到这题,首先想到的是如何把4个数相加变成2个数或者3个数相加这种便于处理的组合。所以第一想法是任意俩个数组套用for循环把所有组合可能性求出,这样4个数组相加就变成2个数组相加了。再利用HashMap的特性去求在一个数组中存在多少个数使得2个数相加为0.
public int fourSumCount(int[] A, int[] B, int[] C, int[] D) {
HashMap<Integer,Integer> map = new HashMap<>();
int length = A.length;
int count = 0;
for(int i = 0; i < length; i++){
for(int j = 0; j < length; j++){
int sum1 = A[i] + B[j];
map.put(sum1,map.getOrDefault(sum1,0)+1);
}
}
for(int i = 0; i < length; i++) {
for (int j = 0; j < length; j++) {
int sum2 = C[i] + D[j];
count += map.getOrDefault(-sum2,0); //如果存在-sum2,就返回那个数的key,要不然就使用default value 0.
}
}
return count;
}
不过让我比较吃惊的是我看到别人不利用HashMap, 直接俩个数组来一一判断居然比利用HashMap要快。。。