algorithm/LeetCode-Go
1
0
Fork 0
mirror of https://github.com/halfrost/LeetCode-Go.git synced 2025-07-04 16:12:47 +08:00
Code Issues Packages Projects Releases Wiki Activity

Add solution 0958

Browse Source
This commit is contained in:
halfrost
2021-08-18 21:21:21 +08:00
parent 086c7c9eda
commit c551601a99
4 changed files with 1787 additions and 1688 deletions
Download Patch File Download Diff File Expand all files Collapse all files

3411
README.md
View File

File diff suppressed because it is too large Load Diff

2
website/content/ChapterFour/0900~0999/0953.Verifying-an-Alien-Dictionary.md
View File

@ -84,5 +84,5 @@ func isAlienSorted(words []string, order string) bool {
----------------------------------------------
<div style="display: flex;justify-content: space-between;align-items: center;">
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0900~0999/0952.Largest-Component-Size-by-Common-Factor/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0900~0999/0959.Regions-Cut-By-Slashes/">下一页➡️</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0900~0999/0958.Check Completeness of a Binary Tree/">下一页➡️</a></p>
</div>

60
website/content/ChapterFour/0900~0999/0958.Check Completeness of a Binary Tree.md Normal file
View File

@ -0,0 +1,60 @@
# [958. Check Completeness of a Binary Tree](https://leetcode.com/problems/check-completeness-of-a-binary-tree/)
## 题目
Given the root of a binary tree, determine if it is a complete binary tree.
In a complete binary tree, every level, except possibly the last, is completely filled, and all nodes in the last level are as far left as possible. It can have between 1 and 2h nodes inclusive at the last level h.
Example 1:
```c
Input: root = [1,2,3,4,5,6]
Output: true
Explanation: Every level before the last is full (ie. levels with node-values {1} and {2, 3}), and all nodes in the last level ({4, 5, 6}) are as far left as possible.
1
/ \
2 3
/ \ /
4 5 6
```
Example 2:
```c
Input: root = [1,2,3,4,5,null,7]
Output: false
Explanation: The node with value 7 isn't as far left as possible.
1
/ \
2 3
/ \ \
4 5 7
```
Constraints:
The number of nodes in the tree is in the range [1, 100].
1 <= Node.val <= 1000
## 题目大意
若设二叉树的深度为 h，除第 h 层外，其它各层 (1～h-1) 的结点数都达到最大个数，第 h 层所有的结点都连续集中在最左边，这就是完全二叉树。（注：第 h 层可能包含 1~ 2h 个节点。）
说明要判断每个节点的左孩子必须不为空。
## 解题思路
- 这一题是按层序遍历的变种题。
- 判断每个节点的左孩子是否为空。
- 第 102,107,199 都是按层序遍历的。
----------------------------------------------
<div style="display: flex;justify-content: space-between;align-items: center;">
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0900~0999/0953.Verifying-an-Alien-Dictionary/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0900~0999/0959.Regions-Cut-By-Slashes/">下一页➡️</a></p>
</div>

2
website/content/ChapterFour/0900~0999/0959.Regions-Cut-By-Slashes.md
View File

@ -152,6 +152,6 @@ func getFaceIdx(size, i, j, k int) int {
----------------------------------------------
<div style="display: flex;justify-content: space-between;align-items: center;">
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0900~0999/0953.Verifying-an-Alien-Dictionary/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0900~0999/0958.Check Completeness of a Binary Tree/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0900~0999/0961.N-Repeated-Element-in-Size-2N-Array/">下一页➡️</a></p>
</div>