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

更新 0617.合并二叉树 排版格式修复

Browse Source
This commit is contained in:
jinbudaily
2023-07-21 20:18:53 +08:00
parent b4eefe9859
commit eadc704c38
1 changed files with 4 additions and 5 deletions
Download Patch File Download Diff File Expand all files Collapse all files

9
problems/0617.合并二叉树.md
View File

@ -19,9 +19,9 @@
注意: 合并必须从两个树的根节点开始。
# 视频讲解
# 算法公开课
**《代码随想录》算法视频公开课：[一起操作两个二叉树？有点懵！| LeetCode：617.合并二叉树](https://www.bilibili.com/video/BV1m14y1Y7JK)，相信结合视频在看本篇题解，更有助于大家对本题的理解**。
**[《代码随想录》算法视频公开课](https://programmercarl.com/other/gongkaike.html)：[一起操作两个二叉树？有点懵！| LeetCode：617.合并二叉树](https://www.bilibili.com/video/BV1m14y1Y7JK)，相信结合视频在看本篇题解，更有助于大家对本题的理解**。
## 思路
@ -164,7 +164,7 @@ public:
};
```
## 迭代法
### 迭代法
使用迭代法，如何同时处理两棵树呢？
@ -716,7 +716,7 @@ object Solution {
}
```
### rust
### Rust
递归：
@ -793,4 +793,3 @@ impl Solution {
<a href="https://programmercarl.com/other/kstar.html" target="_blank">
<img src="../pics/网站星球宣传海报.jpg" width="1000"/>
</a>