309.最佳买卖股票时机含冷冻期
题目链接:309.最佳买卖股票时机含冷冻期
文档链接:309.最佳买卖股票时机含冷冻期
视频链接:动态规划来决定最佳时机,这次有冷冻期!| LeetCode:309.买卖股票的最佳时机含冷冻期
C++实现
class Solution {
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];
dp[0][1] = 0;
dp[0][2] = 0;
dp[0][3] = 0;
for (int i = 1; i < prices.size(); i++) {
dp[i][0] = max(dp[i - 1][0], max(dp[i - 1][2] - prices[i],
dp[i - 1][3] - prices[i]));
dp[i][1] = dp[i - 1][0] + prices[i];
dp[i][2] = dp[i - 1][1];
dp[i][3] = max(dp[i - 1][2], dp[i - 1][3]);
}
return max(dp[prices.size() - 1][3],
max(dp[prices.size() - 1][1], dp[prices.size() - 1][2]));
}
};
714.买卖股票的最佳时机含手续费
题目链接:714.买卖股票的最佳时机含手续费
文档链接:714.买卖股票的最佳时机含手续费
视频链接:动态规划来决定最佳时机,这次含手续费!| LeetCode:714.买卖股票的最佳时机含手续费
C++实现
class Solution {
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] = 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];
}
};