七月day18——树

最新推荐文章于 2024-09-13 16:27:15 发布

-特立独行的猪-

最新推荐文章于 2024-09-13 16:27:15 发布

阅读量121

点赞数

文章标签：深度优先算法

本文链接：https://blog.csdn.net/qq_41945053/article/details/125840673

版权

数据结构与算法专栏收录该内容

33 篇文章 0 订阅

订阅专栏

T1:leetcode.1339 分裂二叉树的最大乘积

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:
    long long ans = 0;
    int n = 0;
    unordered_map<TreeNode*, int> umap;

    int getSum(TreeNode* root) {
        if (root == nullptr) return 0;
        umap[root] = root->val + getSum(root->left) + getSum(root->right);
        return umap[root];
    }
    void dfs(TreeNode* root) {
        if (root->left) {
            ans = max(ans, (long long)umap[root->left] * (n - umap[root->left]));
            dfs(root->left);
        }
        if (root->right) {
            ans = max(ans, (long long)umap[root->right] * (n - umap[root->right]));
            dfs(root->right);
        }
    }
    int maxProduct(TreeNode* root) {
        n = getSum(root);
        ans = 0;
        dfs(root);
        return ans % 1000000007;
    }
};
/*
1.计算出所有值的和 getSum
2.计算最大乘积 dfs
3.int类型溢出 换成longlong
*/