题解 | #牛群平均重量#

/**
 * struct TreeNode {
 *	int val;
 *	struct TreeNode *left;
 *	struct TreeNode *right;
 *	TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 * };
 */
#include <vector>
class Solution {
public:
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     * 
     * @param root TreeNode类 
     * @return double浮点型vector
     */
    vector<double> averageOfLevels(TreeNode* root) {
        // write code here

        // 广度优先搜索
        vector<double> v;
        if(!root)
            return v;

        queue<TreeNode*> q;
        q.push(root);
        
        while(!q.empty())
        {
            double sum = 0;
            int len = q.size();

            for(int i=0; i<len; ++i)
            {
                TreeNode* t = q.front();
                q.pop();
                sum += (double)t->val;

                if(t->left)
                    q.push(t->left);
                if(t->right)
                    q.push(t->right);
            }

            v.emplace_back(sum/(double)len);
        }

        return v;
    }
};