/**
* 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* tree) {
vector<ListNode*> res;
if (tree == nullptr) return res;
queue<TreeNode*> que;
que.push(tree);
while (!que.empty()) {
ListNode* head = nullptr;
ListNode* prev = nullptr;
int curSize = que.size();
for (int i = 0; i < curSize; i++) {
TreeNode* node = que.front();
que.pop();
ListNode* newNode = new ListNode(node->val);
if (head == nullptr) head = newNode;
else prev->next = newNode;
prev = newNode;
if (node->left) que.push(node->left);
if (node->right) que.push(node->right);
}
res.push_back(head);
}
return res;
}
};
Leetcode 面试题 04.03. 特定深度节点链表
最新推荐文章于 2021-06-30 00:29:24 发布