Kaka777

题解

个人题解笔记(1)

/ 注册

全部文章 / 题解（共12篇）

题解 | #岛屿数量#

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