Kaka777

分类

个人题解笔记(1) 题解(12)

/ 注册

全部文章（共4篇）

题解 | #重建二叉树#

Divider and conquer with recursion:for each tree, it is composed of three parts: root-left branch, right branch. each branch is also composed of root&...

devider and conquer recursion Python hashtable

2021-08-06

0 389

题解 | #括号生成#

Backtracking is also DFS but it is a little bit different from DFS. the nuance is we backtrack to the previous level of the tree so we have pop-off ac...

backtrack dfs Python

2021-08-05

0 375

题解 | #岛屿数量#

DFS: once '1' is found then trigger dfs() to search all adjacent '1' and flip them as '0', since all adjacent '1' are regarded as one island. Use for ...

dfs python

2021-08-05

0 493

题解 | #实现二叉树先序，中序和后序遍历#

Binary Tree Traversal: recursion class Solution: def threeOrders(self , root ): &...

recursion Python

2021-08-05

0 378