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

738.单调递增的数字 

class Solution {
public: 
    int monotoneIncreasingDigits(int n) 
    {
        string strnum=to_string(n);
        int flag=strnum.size();
        for(int i=strnum.size()-1;i>0;i--)
        {
            if(strnum[i-1]>strnum[i])
            {
                strnum[i-1]--;
                flag=i;
            }
            for(int i=flag;i<strnum.size();i++)
            strnum[i]='9';
        }

return stoi(strnum);


    }
};

  968.监控二叉树 

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
private:
int res;
int traversal(TreeNode*cur)
    {
        if(cur==nullptr)
        return 2;
        int left=traversal(cur->left);
        int right=traversal(cur->right);

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

        }
        if(left==1||right==1)
        {
            return 2;
        }

        return -1;
    }
public:
    int minCameraCover(TreeNode* root) 
    {
res=0;
if(traversal(root)==0)
res++;

return res;


    }
};