coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-10-18 11:36:48 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

更新国内版力扣题目描述变更

Browse Source
This commit is contained in:
小墨
2022-05-02 23:42:43 +08:00
parent 74598d1cf8
commit 7ea03594b3
198 changed files with 11378 additions and 11118 deletions
Download Patch File Download Diff File Expand all files Collapse all files

56
leetcode-cn/problem (English)/检查平衡性(English) [check-balance-lcci].html
View File

@@ -1,28 +1,28 @@
<p>Implement a function to check if a binary tree is balanced. For the purposes of this question, a balanced tree is defined to be a tree such that the heights of the two subtrees of any node never differ by more than one.</p>
<p><br />
<strong>Example 1:</strong></p>
<pre>
Given tree [3,9,20,null,null,15,7]
3
/ \
9 20
/ \
15 7
return true.</pre>
<p><strong>Example 2:</strong></p>
<pre>
Given [1,2,2,3,3,null,null,4,4]
1
/ \
2 2
/ \
3 3
/ \
4 4
return&nbsp;false.</pre>
<p>&nbsp;</p>
<p>Implement a function to check if a binary tree is balanced. For the purposes of this question, a balanced tree is defined to be a tree such that the heights of the two subtrees of any node never differ by more than one.</p>
<p><br />
<strong>Example 1:</strong></p>
<pre>
Given tree [3,9,20,null,null,15,7]
3
/ \
9 20
/ \
15 7
return true.</pre>