309. 最佳买卖股票时机含冷冻期
题目连接
笔记
class Solution {
public:
int maxProfit(vector<int>& prices) {
if (prices.size() < 2) return 0;
vector<vector<int>> dp(prices.size(), {0, 0});
dp[0][0] = 0;
dp[0][1] = -prices[0];
dp[1][0] = max(dp[0][0], dp[0][1] + prices[1]);
dp[1][1] = max(dp[0][1], dp[0][0] - prices[1]);
for (int i = 2; i < dp.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 - 2][0] - prices[i]);
}
return dp.back()[0];
}
};
714. 买卖股票的最佳时机含手续费
题目连接
笔记
class Solution {
public:
int maxProfit(vector<int>& prices, int fee) {
vector<vector<int>> dp(prices.size(), {0, 0});
dp[0][0] = 0;
dp[0][1] = -prices[0];
for (int i = 1; i < dp.size(); i++) {
dp[i][0] = max(dp[i - 1][0], dp[i - 1][1] + prices[i] - fee);
dp[i][1] = max(dp[i - 1][1], dp[i - 1][0] - prices[i]);
}
return dp.back()[0];
}
};