[Leetcode] 637. Average of Levels in Binary Tree 解题报告

最新推荐文章于 2022-07-08 08:19:09 发布

魔豆Magicbean

最新推荐文章于 2022-07-08 08:19:09 发布

阅读量272

点赞数

分类专栏： IT公司面试习题文章标签： Leetcode 解题报告 Tree

本文链接：https://blog.csdn.net/magicbean2/article/details/79126759

版权

IT公司面试习题专栏收录该内容

736 篇文章 5 订阅

订阅专栏

题目：

Given a non-empty binary tree, return the average value of the nodes on each level in the form of an array.

Example 1:

Input:
    3
   / \
  9  20
    /  \
   15   7
Output: [3, 14.5, 11]
Explanation:
The average value of nodes on level 0 is 3,  on level 1 is 14.5, and on level 2 is 11. Hence return [3, 14.5, 11].

Note:

The range of node's value is in the range of 32-bit signed integer.

思路：

练手题目，哈哈。

代码：

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    vector<double> averageOfLevels(TreeNode* root) {
        vector<double> sums;
        vector<int> counts;
        averageOfLevels(root, sums, counts, 0);
        for (int i = 0; i < sums.size(); ++i) {
            sums[i] /= counts[i];
        }
        return sums;
    }
private:
    void averageOfLevels(TreeNode* root, vector<double> &sums, vector<int> &counts, int level) {
        if (!root) {
            return;
        }
        if (sums.size() <= level) {
            sums.push_back(0.0);
            counts.push_back(0);
        }
        sums[level] += root->val;
        counts[level]++;
        averageOfLevels(root->left, sums, counts, level + 1);
        averageOfLevels(root->right, sums, counts, level + 1);
    }
};