代码随想录算法训练营第五十一天| LeetCode309.最佳买卖股票时机含冷冻期 714.买卖股票的最佳时机含手续费

309.最佳买卖股票时机含冷冻期

题目:力扣

class Solution {
public:
    int maxProfit(vector& prices) {
        vector > dp(prices.size(), vector(4,0));
        dp[0][0] = -prices[0];
        for(int i = 1; i < prices.size(); ++i){
            dp[i][0] = max(dp[i-1][0], max(dp[i-1][1]- prices[i],dp[i-1][3] - prices[i]) ) ;
            dp[i][1] = max(dp[i-1][1],dp[i-1][3]);
            dp[i][2] = dp[i-1][0] + prices[i];
            dp[i][3] = dp[i-1][2];
        }
        return max(dp[prices.size() - 1][2],dp[prices.size()-1][3]);
    }
};

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

题目:力扣

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

总结

题目:买卖股票

你可能感兴趣的:(代码随想录算法训练营,leetcode,算法,c++,动态规划)