算法跟学Day37【代码随想录】

第八章 贪心算法 part06

大纲

● 738.单调递增的数字
● 968.监控二叉树
● 总结

leetcode 738 单调递增的数字

class Solution {
    public int monotoneIncreasingDigits(int n) {
        String s = String.valueOf(n);
        char[] ch = s.toCharArray();
        int start = s.length();
        for (int i = s.length() - 2; i >= 0; i--) {
            if (ch[i] > ch[i + 1]) {
                ch[i]--;
                start = i + 1;
            }
        }
        for (int i = start; i < s.length(); i++) ch[i] = '9';
        return Integer.parseInt(String.valueOf(ch));
    }
}

leetcode 738 监控二叉树

 */
class Solution {
    int res = 0;
    public int minCameraCover(TreeNode root) {
        if (minCame(root) == 0) res++;
        return res;
    }
    
    // 0：节点安装了监视器 1：节点可观但没有安装监视器 2：该节点不可观
    private int minCame(TreeNode node) {
        if (node == null) return 2;
        int left = minCame(node.left);
        int right = minCame(node.right);
        if (left == 2 && right == 2) return 0;
        else if (left == 0 || right == 0) {
            res++;
            return 1;
        } else return 2;
    }
}

总结

• 贪心还是得多练多想