代码随想三刷贪心篇5

738. 单调递增的数字

题目

链接

代码

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

968. 监控二叉树

题目

链接

代码

/**
 * 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 {
    public int minCameraCover(TreeNode root) {
        if(postorder(root)==3){
            count++;
        }
        return count;
    }
    /*
    1 : 监控节点
    2 ：覆盖节点
    3 ：无覆盖节点
    */
    int count = 0;
    public int postorder(TreeNode root){
        if(root==null){
            return 2;
        }
        int lef = postorder(root.left);
        int righ = postorder(root.right);
        if(lef==2&&righ==2){
            //(2,2)
            return 3;
        }else if(lef==3||righ==3){
            //(3,1)(3,2)(3,3) (1,3)(2,3) 
            count++;
            return 1;
        }else{
            //(1,1)(1,2)(2,1)
            
            return 2;
        }
        

    }
}