454. 4Sum II

最新推荐文章于 2022-07-07 22:59:55 发布

myfwjy

最新推荐文章于 2022-07-07 22:59:55 发布

阅读量595

点赞数

分类专栏： LeetCode 文章标签： LeetCode

本文链接：https://blog.csdn.net/myfwjy/article/details/53490284

版权

LeetCode 专栏收录该内容

91 篇文章 0 订阅

订阅专栏

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

思路：

如果选择四个遍历的话应该会超时，所以先两个遍历记住前面的和，然后再进行C和D的遍历与之匹配。

public 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;
		}
		HashMap<Integer, Integer> abList = new HashMap<Integer, Integer>();
		for (int i = 0; i < A.length; i++) {
			for (int j = 0; j < B.length; j++) {
				abList.put(A[i] + B[j], abList.getOrDefault(A[i] + B[j], 0) + 1);
			}
		}
		int count = 0;
		for (int i = 0; i < C.length; i++) {
			for (int j = 0; j < D.length; j++) {
				int tmp = - C[i] - D[j];
				count += abList.getOrDefault(tmp, 0);
			}
		}
		return count;
    }
}