LeetCode-454. 4Sum II

刷子c

于 2019-10-01 22:01:18 发布

阅读量72

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/qq_40940281/article/details/101868376

版权

leetcode 专栏收录该内容

6 篇文章 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:

(0, 0, 0, 1) -> A[0] + B[0] + C[0] + D[1] = 1 + (-2) + (-1) + 2 = 0
(1, 1, 0, 0) -> A[1] + B[1] + C[0] + D[0] = 2 + (-1) + (-1) + 0 = 0

题解

class Solution {
public:
    int fourSumCount(vector<int>& A, vector<int>& B, vector<int>& C, vector<int>& D) {
        unordered_map<int, int> mp;
        for(int x : A){
            for(int y : B){
                ++mp[(x+y)];
            }
        }
        int ans=0;
        for(int x : C){
            for(int y : D){
                ans += mp[-(x+y)];
            }
        }
        return ans;
    }
};