algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-06 23:28:29 +08:00
Code Issues Packages Projects Releases Wiki Activity

Merge pull request #1913 from roylx/master

Browse Source 
修正了501python版本的空间复杂度的描述
This commit is contained in:
程序员Carl
2023-02-28 09:21:56 +08:00
committed by GitHub
parent 95f200bb89 76d84f83e2
commit b5c65c6c4f
1 changed files with 4 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

5
problems/0501.二叉搜索树中的众数.md
View File

@ -476,6 +476,7 @@ class Solution {
## Python
> 递归法
> 常量空间，递归产生的栈不算
```python
# Definition for a binary tree node.
@ -521,7 +522,9 @@ class Solution:
```
> 迭代法-中序遍历-不使用额外空间，利用二叉搜索树特性
> 迭代法-中序遍历
> 利用二叉搜索树特性，在历遍过程中更新结果，一次历遍
> 但需要使用额外空间存储历遍的节点
```python
class Solution:
def findMode(self, root: TreeNode) -> List[int]: