637Submission Details

最新推荐文章于 2024-11-11 20:59:17 发布

栾城

最新推荐文章于 2024-11-11 20:59:17 发布

阅读量257

点赞数

分类专栏： leetcode 文章标签： leetcode

本文链接：https://blog.csdn.net/qq_31336891/article/details/78607654

版权

leetcode 专栏收录该内容

16 篇文章 0 订阅

订阅专栏

637Submission Details

源自leetcode

思路

使用递归重复的往open表里面添加何删除待遍历的层数。

代码

vector<double> push(list <TreeNode> &open, vector<double> &averages) {
        if (!open.size())
            return averages;
        double sum = 0;
        int amout = 0;
        for (auto iter = open.begin(); iter != open.end(); iter++) {
            sum = (*iter).val + sum;
            amout++;
        }
        averages.push_back(sum / amout);
        list <TreeNode> list{};
        for (auto iter = open.begin(); iter != open.end(); iter++) {
            if ((*iter).left)
                list.push_back(*((*iter).left));
            if ((*iter).right)
                list.push_back(*((*iter).right));
        }
        averages = push(list, averages);
        return averages;
    }

    vector<double> averageOfLevels(TreeNode *root) {
        vector<double> averages{};
        averages.push_back(root->val);

        list <TreeNode> open{};
        if (root->left)
            open.push_back(*(root->left));
        if (root->right)
            open.push_back(*(root->right));
        averages=push(open, averages);
        for(auto iter=averages.begin();iter!=averages.end();iter++)
        {
            cout<<*iter<<ends;
        }
        return averages;
    }