LeetCode-4Sum II

最新推荐文章于 2021-07-28 10:25:52 发布

BeHelium

最新推荐文章于 2021-07-28 10:25:52 发布

阅读量167

点赞数

分类专栏： LeetCode 文章标签： LeetCode Java Hash Table

本文链接：https://blog.csdn.net/qq_24133491/article/details/95043211

版权

LeetCode 专栏收录该内容

306 篇文章 0 订阅

订阅专栏

Description：
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

题意：给定四个整数序列 $A, B, C, D$ ，要求找出所有可能满足 $A [i] + B [j] + C [k] + D [l] = = 0$ 的情况；

解法：要找出所有满足 $A [i] + B [j] + C [k] + D [l] = = 0$ 的情况，即满足 $A [i] + B [j] = - (C [k] + D [l])$ ，我们用哈希表存储序列 $A, B$ 和的所有可能取值，之后再遍历 $C, D$ 的所有可能取值，累加上其取值的相反数在 $A, B$ 和的哈希表中的取值情况；

Java

class Solution {
    public int fourSumCount(int[] A, int[] B, int[] C, int[] D) {
        HashMap<Integer, Integer> map = new HashMap<>();
        for (int a: A) {
            for (int b: B) {
                map.put(a + b, map.getOrDefault(a + b, 0) + 1);
            }
        }
        int result = 0;
        for (int c: C) {
            for (int d: D) {
                int sum = -(c + d);
                if (map.containsKey(sum)) {
                    result += map.get(sum);
                }
            }
        }
        return result;
    }
}