add: 220310-CN [cpp]
This commit is contained in:
parent
d3e0d07df8
commit
9ff0adaf36
|
|
@ -0,0 +1,32 @@
|
|||
#include <vector>
|
||||
#include <functional>
|
||||
|
||||
// Definition for a Node.
|
||||
class Node {
|
||||
public:
|
||||
int val;
|
||||
std::vector<Node*> children;
|
||||
|
||||
Node(int _val, std::vector<Node*> _children) : val(_val), children(std::move(_children)) {}
|
||||
};
|
||||
|
||||
/**
|
||||
* 589. N-ary Tree Preorder Traversal
|
||||
* Given the root of an n-ary tree, return the preorder traversal of its nodes' values.
|
||||
* Nary-Tree input serialization is represented in their level order traversal. Each group of children is separated by the null value (See examples)
|
||||
*/
|
||||
|
||||
class Solution {
|
||||
public:
|
||||
static std::vector<int> preorder(Node* root) {
|
||||
std::vector<int> ret;
|
||||
std::function<void(const Node* const)> traverse = [&](const Node* const ptr) {
|
||||
if (!ptr) return;
|
||||
ret.push_back(ptr->val);
|
||||
for (const Node* const i : ptr->children)
|
||||
traverse(i);
|
||||
};
|
||||
traverse(root);
|
||||
return ret;
|
||||
}
|
||||
};
|
||||
|
|
@ -3,4 +3,4 @@ PROJECT(2203)
|
|||
|
||||
SET(CMAKE_CXX_STANDARD 23)
|
||||
|
||||
ADD_EXECUTABLE(2203 220309.cpp)
|
||||
ADD_EXECUTABLE(2203 220310-CN.cpp)
|
||||
|
|
|
|||
Loading…
Reference in New Issue