Leetcode
刷题记录
Tscharrl
这个作者很懒,什么都没留下…
展开
-
Leetcode606. Construct String from Binary Tree (C++)
Leetcode606. Construct String from Binary TreeLeetcode606. Construct String from Binary Tree递归方法可以一行完成,迭代方法比较麻烦。复杂度不佳,尚待提高。代码如下:/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right原创 2020-05-11 16:22:26 · 155 阅读 · 0 评论 -
Leetcode590. N-ary Tree Postorder Traversal (C++)
Leetcode590. N-ary Tree Postorder TraversalLeetcode590. N-ary Tree Postorder Traversal和589类似,注意孩子节点的入栈顺序即可代码如下:/*// Definition for a Node.class Node {public: int val; vector<Node*> children; Node() {} Node(int _val) {原创 2020-05-10 15:52:29 · 263 阅读 · 0 评论 -
Leetcode589. N-ary Tree Preorder Traversal (C++)
Leetcode589. N-ary Tree Preorder TraversalLeetcode589. N-ary Tree Preorder Traversal递归与非递归(DFS):/*// Definition for a Node.class Node {public: int val; vector<Node*> children; Node() {} Node(int _val) { val = _val;原创 2020-05-10 14:59:55 · 200 阅读 · 0 评论 -
Leetcode617. Merge Two Binary Trees (C++)
Leetcode617. Merge Two Binary Trees简单题,迭代比递归复杂一点点代码如下:/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode() : val(0), left(nullptr), right(nullptr) {} * TreeN原创 2020-05-10 14:18:51 · 162 阅读 · 0 评论 -
Leetcode面试题 04.02. 最小高度树 (C++)
Leetcode面试题 04.02. 最小高度树面试题 04.02. 最小高度树简单递归构造树,解答如下:/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */clas原创 2020-05-10 11:06:28 · 191 阅读 · 0 评论