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

Merge pull request #1627 from zhicheng-lee/zhicheng-lee-patch-7

Browse Source 
更新 0968.监控二叉树.md
This commit is contained in:
程序员Carl
2022-09-08 09:45:30 +08:00
committed by GitHub
parent 96d1d57679 65fae3b975
commit a06668f38d
1 changed files with 6 additions and 6 deletions
Download Patch File Download Diff File Expand all files Collapse all files

12
problems/0968.监控二叉树.md
View File

@ -71,7 +71,7 @@
后序遍历代码如下：
```
```CPP
int traversal(TreeNode* cur) {
// 空节点，该节点有覆盖
@ -124,7 +124,7 @@ int traversal(TreeNode* cur) {
代码如下：
```
```CPP
// 空节点，该节点有覆盖
if (cur == NULL) return 2;
```
@ -143,7 +143,7 @@ if (cur == NULL) return 2;
代码如下：
```
```CPP
// 左右节点都有覆盖
if (left == 2 && right == 2) return 0;
```
@ -163,7 +163,7 @@ left == 2 && right == 0 左节点覆盖，右节点无覆盖
此时摄像头的数量要加一，并且return 1，代表中间节点放摄像头。
代码如下：
```
```CPP
if (left == 0 || right == 0) {
result++;
return 1;
@ -180,7 +180,7 @@ left == 1 && right == 1 左右节点都有摄像头
代码如下：
```
```CPP
if (left == 1 || right == 1) return 2;
```
@ -198,7 +198,7 @@ if (left == 1 || right == 1) return 2;
所以递归结束之后，还要判断根节点，如果没有覆盖，result++，代码如下：
```
```CPP
int minCameraCover(TreeNode* root) {
result = 0;
if (traversal(root) == 0) { // root 无覆盖