LeetCode 454. 4Sum II

最新推荐文章于 2021-12-25 19:07:23 发布

taoqick

最新推荐文章于 2021-12-25 19:07:23 发布

阅读量131

点赞数

分类专栏： leetcode 算法

本文链接：https://blog.csdn.net/taoqick/article/details/105428008

版权

算法同时被 2 个专栏收录

474 篇文章 6 订阅

订阅专栏

leetcode

231 篇文章 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

-------------------------------------------------------------

Affected by 3 sum, it's easy to find out a O(n^3) solution. But actually, there's a O(n^2) solution:

class Solution:
    def get_two_sum(self, A, B):
        res = {}
        for a in A:
            for b in B:
                cur = a+b
                cnt = res.get(cur,0) + 1
                res[cur] = cnt
        return res
    def fourSumCount(self, A: List[int], B: List[int], C: List[int], D: List[int]) -> int:
        res = 0
        d1 = self.get_two_sum(A,B)
        for c in C:
            for d in D:
                cur = -c-d
                if (cur in d1):
                    res += d1[cur]
        return res