新农上路
- 积分
- 98
- 大米
- 颗
- 鳄梨
- 个
- 水井
- 尺
- 蓝莓
- 颗
- 萝卜
- 根
- 小米
- 粒
- 学分
- 个
- 注册时间
- 2014-3-23
- 最后登录
- 1970-1-1
|
6/5
快速复习一些可用recursion来写的题目。主要复习一下recursion思想
- Balanced Binary Tree
- Binary Tree Inorder Traversal
- Binary Tree Postorder Traversal
- Binary Tree Preorder Traversal
- Convert Sorted Array to Binary Search Tree with Minimal Height
- Flatten List
- Maximum Depth of Binary Tree
- Subtree
补充内容 (2017-6-7 21:25):
6/6
昨天上班好忙。回来只刷了三道:
- Binary Tree Maximum Path Sum
- Convert Sorted List to Balanced BST
- Flatten Nested List Iterator
补充内容 (2017-6-8 06:27):
6/7 继续练一些recursion的题目
- Sum Root to Leaf Numbers
- Same Tree
- Symmetric Tree
- Minimum Depth of Binary Tree
- Binary Tree Path
- Minimum Subtree
补充内容 (2017-6-9 22:40):
6/8
- Subtree with Maximum Average
- Flatten Binary Tree to Linked List
补充内容 (2017-6-12 05:07):
6/10 & 11
- Construct Binary Tree from Preorder and Inorder Traversal
- Construct Binary Tree from Inorder and Postorder Traversal
- Binary Tree Right Side View
- Recover Binary Search Tree
补充内容 (2017-6-14 22:43):
6/14
Expression Expand 递归不好做。用栈来做容易些
Generate Parentheses: DFS + backtracking
补充内容 (2017-6-21 08:34):
6/20
Path Sum 系列 I - IV |
|