Leetcode之Binary Tree Cameras

最新推荐文章于 2024-10-11 22:20:00 发布

一只荣

最新推荐文章于 2024-10-11 22:20:00 发布

阅读量130

点赞数

分类专栏： leetcode和机试题文章标签： leetcode

本文链接：https://blog.csdn.net/qq_35455503/article/details/105406890

版权

leetcode和机试题专栏收录该内容

509 篇文章 3 订阅

订阅专栏

题目：

Given a binary tree, we install cameras on the nodes of the tree.

Each camera at a node can monitor its parent, itself, and its immediate children.

Calculate the minimum number of cameras needed to monitor all nodes of the tree.

Example 1:

转存失败重新上传取消

Input: [0,0,null,0,0]
Output: 1
Explanation: One camera is enough to monitor all nodes if placed as shown.

Example 2:

转存失败重新上传取消

Input: [0,0,null,0,null,0,null,null,0]
Output: 2
Explanation: At least two cameras are needed to monitor all nodes of the tree. The above image shows one of the valid configurations of camera placement.

Note:

The number of nodes in the given tree will be in the range [1, 1000].
Every node has value 0.

代码：

贪心法——

class Solution {
private:
    int ans = 0;

    int dfs(TreeNode* root) {
        if (root->left == NULL && root->right == NULL) return 0;
        int needCamera = 0;
        int covered = 0;
        if (root->left != NULL) {
            int state = dfs(root->left);
            if (state == 0) needCamera = 1;
            if (state == 1) covered = 1;
        }
        if (root->right != NULL) {
            int state = dfs(root->right);
            if (state == 0) needCamera = 1;
            if (state == 1) covered = 1;
        }
        if (needCamera) {
            ans++;
            return 1;
        }
        if (covered) return 2;
        return 0;
    }
    
public:
    int minCameraCover(TreeNode* root) {
        int state = dfs(root);
        if (state == 0) ans++;
        return ans;
    }
};

思路：令状态0表示该结点还没有被cover，1表示该结点上有一个照相机，2表示该结点上没有照相机但是已经被cover了。（前提：这个结点对应的子树除了它自己以外已经全都被cover了。

令叶结点的状态为0；对于一个结点，如果它的至少一个子结点状态为0，则它的状态为1；如果它的子结点状态均不为0，且至少一个子结点状态为1，则它的状态为2；否则它的状态为0。状态为1时照相机计数+1。

注意边界条件（如果根节点的状态为0，则需要多加一个照相机）。[1]

我实在想不通怎么证明这个解法的正确性（虽然我觉得它确实很有道理）。

DP法——