[leetcode] 454. 4Sum II

最新推荐文章于 2021-08-20 00:33:10 发布

yaozhili_

最新推荐文章于 2021-08-20 00:33:10 发布

阅读量188

点赞数

分类专栏： leetcode解题报告文章标签： leetcode

本文链接：https://blog.csdn.net/yaozhili_/article/details/78617380

版权

leetcode解题报告专栏收录该内容

67 篇文章 0 订阅

订阅专栏

Question:

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

Solution:

记录起A和B所有元素两两相加的结果，以及C和D两两相减的结果，然后再遍历一遍看能否找到上述两个结果相同的元素。
实际操作中，使用map来记录中间结果，加快搜索相同结果时的速度，也避免了对重复结果的搜索。

class Solution {
public:
    int fourSumCount(vector<int>& A, vector<int>& B, vector<int>& C, vector<int>& D) {
        map<int, int> AB, CD;
        for (int i = 0; i < A.size(); i++) {
            for (int j = 0; j < A.size(); j++) {
                int ab = A[i] + B[j], cd = -C[i] - D[j];
                if (AB.find(ab) != AB.end())
                    AB[ab]++;
                else
                    AB[ab] = 1;
                if (CD.find(cd) != CD.end())
                    CD[cd]++;
                else
                    CD[cd] = 1;
            }
        }
        int res = 0;
        for (auto it = AB.begin(); it != AB.end(); it++) {
            auto tmp = CD.find(it->first);
            if (tmp != CD.end()) {
                res += it->second * tmp->second;
            }
        }
        return res;
    }
};