LeetCode 面试题0403. 特定深度节点链表
原题链接
简单
作者:
大明湖的鱼
,
2021-01-30 12:03:40
,
所有人可见
,
阅读 253
独立完成,一次ac
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
vector<ListNode*> listOfDepth(TreeNode* root) {
queue<TreeNode*> q;
vector<ListNode*> res;
if(root == NULL) return res;
q.push(root);
while(!q.empty()){
int size = q.size();
ListNode* dumpy = new ListNode(0);
ListNode* head = dumpy;
for(int i = 0 ;i< size ;i++){
TreeNode* node = q.front();
q.pop();
ListNode* tmp = new ListNode(node->val);
head->next = tmp;
head = head->next;
if(node->left) q.push(node->left);
if(node->right) q.push(node->right);
}
res.emplace_back(dumpy->next);
}
return res;
}
};