代码随想录打卡37天

最新推荐文章于 2024-07-14 11:23:58 发布

装代码的口袋

最新推荐文章于 2024-07-14 11:23:58 发布

阅读量645

点赞数

文章标签： leetcode 算法动态规划

本文链接：https://blog.csdn.net/qq_43216763/article/details/129120018

版权

738. 单调递增的数字

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

    }
};

714. 买卖股票的最佳时机含手续费

class Solution {
public:
    int maxProfit(vector<int>& prices, int fee) {
        int n=prices.size();
        vector<int> buy(n,0);
        vector<int> sell(n,0);
        buy[0]=-prices[0];
        for(int i=1;i<n;i++)
        {
            buy[i]=max(buy[i-1],sell[i-1]-prices[i]);
            sell[i]=max(sell[i-1],buy[i-1]+prices[i]-fee);
        }
        return max(buy[n-1],sell[n-1]);

    }
};

968. 监控二叉树

class Solution {
private:
    int result;
    int traversal(TreeNode* cur) {

        if (cur == NULL) return 2;
        int left = traversal(cur->left);    
        int right = traversal(cur->right);  
        if (left == 2 && right == 2) return 0;
        if (left == 0 || right == 0) {
            result++;
            return 1;
        }
        if (left == 1 || right == 1) return 2;
        return -1;
    }

public:
    int minCameraCover(TreeNode* root) {
        result = 0;

        if (traversal(root) == 0) { 
            result++;
        }
        return result;
    }
};