【LeetCode637】【BFS/队列】每日一题day13

/**
 * 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) {
        queue<TreeNode *> q;
        q.push(root);
        vector<int> level;
        vector<double> ans;
        while (!q.empty())
        {
            //printf("sSize = %d ", q.size());
            int qSize = q.size();
            for (int i = 0; i < qSize; i++)
            {
                TreeNode *t = q.front();
                q.pop();
                level.push_back(t->val);
                if (t->left)
                {
                    q.push(t->left);
                }
                if (t->right)
                {
                    q.push(t->right);
                }
            }
            int size = level.size();
            //printf ("levelSize = %d ", size);
            double sum = 0;
            for (int i = 0; i < size; i++)
            {
                //printf("%d ", level[i]);
                sum += level[i];
            }
            //printf("\n");
            ans.push_back((double)(sum / size));
            level.clear();
        }
        return ans;
    }
};

很简单的一道题，但是！！我竟然不知道for(int i = 0; i < q.size(); i++)这里面q.size()是会变的= =||| 丢银
然后dfs用栈实现，bfs用队列_(:з」∠)_ 我到底都学了些啥呀【看了这篇博客，写得蛮清楚！】