123. 买卖股票的最佳时机 III
题目连接
笔记
class Solution {
public:
int maxProfit(vector<int>& prices) {
vector<vector<int>> dp(prices.size(), vector<int>(5, 0));
dp[0][1] = -prices[0];
dp[0][3] = -prices[0];
for (int i = 1; i < dp.size(); i++) {
dp[i][0] = dp[i - 1][0];
dp[i][1] = max(dp[i - 1][0] - prices[i], dp[i - 1][1]);
dp[i][2] = max(dp[i - 1][1] + prices[i], dp[i - 1][2]);
dp[i][3] = max(dp[i - 1][2] - prices[i], dp[i - 1][3]);
dp[i][4] = max(dp[i - 1][3] + prices[i], dp[i - 1][4]);
}
return dp.back().back();
}
};
188. 买卖股票的最佳时机 IV
题目连接
笔记
class Solution {
public:
int maxProfit(int k, vector<int>& prices) {
vector<vector<int>> dp(prices.size(), vector<int>(2 * k + 1, 0));
for (int i = 1; i < 2 * k + 1; i += 2) {
dp[0][i] = -prices[0];
}
for (int i = 1; i < dp.size(); i++) {
dp[i][0] = dp[i - 1][0];
for (int j = 1; j < 2 * k + 1; j++) {
if (j % 2 == 1) {
dp[i][j] = max(dp[i - 1][j - 1] - prices[i], dp[i - 1][j]);
}
else {
dp[i][j] = max(dp[i - 1][j - 1] + prices[i], dp[i - 1][j]);
}
}
}
return dp.back().back();
}
};