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

更新 0654.最大二叉树 排版格式修复

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

7
problems/0654.最大二叉树.md
View File

@ -25,9 +25,9 @@
给定的数组的大小在 [1, 1000] 之间。
## 视频讲解
## 算法公开课
**《代码随想录》算法视频公开课：[又是构造二叉树，又有很多坑！| LeetCode：654.最大二叉树](https://www.bilibili.com/video/BV1MG411G7ox)，相信结合视频在看本篇题解，更有助于大家对本题的理解**。
**[《代码随想录》算法视频公开课](https://programmercarl.com/other/gongkaike.html)：[又是构造二叉树，又有很多坑！| LeetCode：654.最大二叉树](https://www.bilibili.com/video/BV1MG411G7ox)，相信结合视频在看本篇题解，更有助于大家对本题的理解**。
## 思路
@ -310,7 +310,7 @@ class Solution:
def constructMaximumBinaryTree(self, nums: List[int]) -> TreeNode:
return self.traversal(nums, 0, len(nums))
```
```
(版本三) 使用切片
@ -587,3 +587,4 @@ impl Solution {
<a href="https://programmercarl.com/other/kstar.html" target="_blank">
<img src="../pics/网站星球宣传海报.jpg" width="1000"/>
</a>