309. 最佳买卖股票时机含冷冻期
class Solution {
// 0(持有)
// 1(保持不持有)
// 2(今天卖出不持有)
// 3(冷冻期)
public:
int maxProfit(vector<int>& prices) {
if (prices.size() == 0) return 0;
vector<vector<int>> dp(prices.size(), vector<int>(4, 0));
dp[0][0] = -prices[0];
for (int i = 1; i < prices.size(); i++) {
dp[i][0] = std::max(dp[i-1][0], std::max(dp[i-1][3] - prices[i], dp[i-1][1] - prices[i]));
dp[i][1] = std::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 std::max(dp[prices.size() - 1][3], std::max(dp[prices.size() - 1][1], dp[prices.size() - 1][2]));
}
};
714. 买卖股票的最佳时机含手续费
class Solution {
// 0(持有)
// 1(不持有)
public:
int maxProfit(vector<int>& prices, int fee) {
if (prices.size() == 0) return 0;
vector<vector<int>> dp(prices.size(), vector<int>(2, 0));
dp[0][0] = -prices[0];
for(int i = 1; i < prices.size(); i++) {
dp[i][0] = std::max(dp[i-1][0], dp[i-1][1] - prices[i]);
dp[i][1] = std::max(dp[i-1][1], dp[i-1][0] + prices[i] - fee);
}
return std::max(dp[prices.size() - 1][0], dp[prices.size() - 1][1]);
}
};