CS_learn/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2026-02-02 18:39:09 +08:00
Code Issues Packages Projects Releases Wiki Activity

替换图片链接

Browse Source
This commit is contained in:
programmercarl
2025-03-17 15:52:23 +08:00
parent 91e7dab72c
commit 86a0208485
216 changed files with 813 additions and 813 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
problems/0538.把二叉搜索树转换为累加树.md
View File

@@ -18,7 +18,7 @@
示例 1：
![538.把二叉搜索树转换为累加树](https://code-thinking-1253855093.file.myqcloud.com/pics/20201023160751832.png)
![538.把二叉搜索树转换为累加树](https://file.kamacoder.com/pics/20201023160751832.png)
* 输入：[4,1,6,0,2,5,7,null,null,null,3,null,null,null,8]
* 输出：[30,36,21,36,35,26,15,null,null,null,33,null,null,null,8]
@@ -67,7 +67,7 @@
遍历顺序如图所示：
![538.把二叉搜索树转换为累加树](https://code-thinking-1253855093.file.myqcloud.com/pics/20210204153440666.png)
![538.把二叉搜索树转换为累加树](https://file.kamacoder.com/pics/20210204153440666.png)
本题依然需要一个pre指针记录当前遍历节点cur的前一个节点，这样才方便做累加。