视频号的网站链接_北京vi设计招聘_2022智慧树互联网与营销创新_seo项目

代码

class Solution {
public:void dfs( TreeNode* root, int level, vector<double> &sums, vector<int> & counts ) {if ( !root ) {return;}if ( level < sums.size() ) {sums[level] += root -> val;counts[level] += 1;} else {sums.push_back( root -> val );counts.push_back( 1 );}dfs( root -> left, level + 1, sums, counts );dfs( root -> right, level + 1, sums, counts );}vector<double> averageOfLevels(TreeNode* root) {auto sums = vector<double> ();auto averages = vector<double> ();auto counts = vector<int> ();dfs( root, 0, sums, counts );int n = sums.size();for ( int i = 0; i < n; i++ ) {averages.push_back( sums[i] / counts[i] );}return averages;}
};