“ Ctrl AC!一起 AC!”
题目:原题
思路:
树的广度优先搜索
代码:
/*
// Definition for a Node.
class Node {
public:
int val;
vector<Node*> children;
Node() {}
Node(int _val) {
val = _val;
}
Node(int _val, vector<Node*> _children) {
val = _val;
children = _children;
}
};
*/
class Solution {
public:
vector<vector<int>> levelOrder(Node* root) {
if(root==NULL) return{};
vector<vector<int>> ans;
queue<Node*> q;
q.push(root);
while(!q.empty()){
vector<int> level;
int cnt=q.size();
for(int i=0;i<cnt;i++){
Node* temp=q.front(); q.pop();
level.push_back(temp->val);
for(int i=0;i<temp->children.size();i++){
q.push(temp->children[i]);
}
}
ans.push_back(level);
}
return ans;
}
};
感谢阅读!!!
“ Ctrl AC!一起 AC!”