给定四个包含整数的数组列表 A , B , C , D ,计算有多少个元组 (i, j, k, l) ,使得 A[i] + B[j] + C[k] + D[l] = 0。
为了使问题简单化,所有的 A, B, C, D 具有相同的长度 N,且 0 ≤ N ≤ 500 。所有整数的范围在 -228 到 228 - 1 之间,最终结果不会超过 231 - 1 。
例如:
输入:
A = [ 1, 2]
B = [-2,-1]
C = [-1, 2]
D = [ 0, 2]
输出:
2
解释:
两个元组如下:
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
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/4sum-ii
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
时间空间复杂度:n2
package com.leetcode.shuati;
import java.util.HashMap;
import java.util.Map;
/**
* @Author: renyitian
* @Date: 4:23 下午 2020/11/27
* @Description:
* @Version v1.0
*/
public class SiShuXiangJia {
public static int fourSumCount(int[] A, int[] B, int[] C, int[] D) {
if(A.length == 0)
return 0;
int count = 0;
for (int i = 0; i < A.length; i++) {
int temp0 = A[i];
for (int j = 0; j < B.length; j++) {
int temp1 = B[j];
for (int k = 0; k < C.length; k++) {
int temp2 = C[k];
for (int l = 0; l < D.length; l++) {
int temp3 = D[l];
if(temp0+temp1+temp2+temp3 == 0){
count++;
}
}
}
}
}
return count;
}
public static int fourSumCount1(int[] A, int[] B, int[] C, int[] D) {
if(A.length == 0)
return 0;
int count = 0;
Map<Integer,Integer> map = new HashMap<>();
for (int a:A) {
for (int b:B) {
map.put(a+b,map.getOrDefault(a+b,0)+1);
}
}
for (int c:C) {
for (int d:D) {
if(map.containsKey(-c-d)){
count+=map.get(-c-d);
}
}
}
return count;
}
public static void main(String[] args) {
int[] A = new int[]{1,2};
int[] B = new int[]{-2,-1};
int[] C = new int[]{-1,2};
int[] D = new int[]{0,2};
System.out.println(fourSumCount1(A,B,C,D));
}
}