题目
题解
- 队列
- 每一层通过queue的长度来决定for循环
- 注意二维数组的赋值
- res.push_back(vector())
- res.back().push_back()
代码
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution {
public:
vector<vector<int>> levelOrder(TreeNode* root) {
vector<vector<int>> res;
if(root==nullptr)
return res;
queue<TreeNode *> que;
que.push(root);
//int colm=0;
while(!que.empty()){
int len=que.size();
res.push_back(vector<int>());
for(int i=0;i<len;i++){
auto node=que.front();
que.pop();
//res[colm][i]=node->val;
res.back().push_back(node->val);
if(node->left!=nullptr)
que.emplace(node->left);
if(node->right!=nullptr)
que.emplace(node->right);
}
//colm++;
}
return res;
}
};