代码随想录训练营第三十五期|第36天|贪心算法 part06|738.单调递增的数字 ● 968.监控二叉树 ● 总结

738. 单调递增的数字 - 力扣（LeetCode）

class Solution {
    public int monotoneIncreasingDigits(int n) {
        String s = String.valueOf(n);
        char[] arr = s.toCharArray();
        int start = arr.length;

        for (int i = arr.length - 2; i >= 0; i--) {
            if (arr[i] > arr[i + 1]) {
                arr[i] -= 1;
                start = i + 1;
            }
        }

        for (int i = start; i < arr.length; i++) {
            arr[i] = '9';
        }
        return Integer.parseInt(String.valueOf(arr));
    }
}

968. 监控二叉树 - 力扣（LeetCode）

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    int res = 0;
    public int minCameraCover(TreeNode root) {
        if (minCamara(root) == 0) {
            res++;
        }
        return res;
    }

    private int minCamara(TreeNode root) {
        if (root == null) {
            return 2;
        }
        int left = minCamara(root.left);
        int right = minCamara(root.right);

        if (left == 2 && right == 2) {
            return 0;
        } else if (left == 0 || right == 0) {
            res++;
            return 1;
        } else {
            return 2;
        }
    }
}