123.买卖股票的最佳时机III
题目链接:123.买卖股票的最佳时机III
文档链接:123.买卖股票的最佳时机III
视频链接:动态规划,股票至多买卖两次,怎么求? | LeetCode:123.买卖股票最佳时机III
C++实现
class Solution {
public:
int maxProfit(vector<int>& prices) {
if (prices.size() <= 0)
return 0;
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 < prices.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[prices.size() - 1][4];
}
};
188.买卖股票的最佳时机IV
题目链接:188.买卖股票的最佳时机IV
文档链接:188.买卖股票的最佳时机IV
视频链接:动态规划来决定最佳时机,至多可以买卖K次!| LeetCode:188.买卖股票最佳时机4
C++实现
class Solution {
public:
int maxProfit(int k, vector<int>& prices) {
if (prices.size() <= 0)
return 0;
vector<vector<int>> dp(prices.size(), vector<int>(2 * k + 1,0));
for (int i = 1; i < 2 * k; i += 2) {
dp[0][i] = -prices[0];
}
for(int i =1;i<prices.size();i++){
/*
for(int j = 0; j<2*k-1;j+=2){
dp[i][j+1] = max(dp[i-1][j] -prices[i], dp[i-1][j+1]);
dp[i][j+2] = max(dp[i-1][j+1] + prices[i], dp[i-1][j+2]);
}
*/
for(int j = 1; j<2*k;j+=2){
dp[i][j] = max(dp[i-1][j-1] -prices[i], dp[i-1][j]);
dp[i][j+1] = max(dp[i-1][j] + prices[i], dp[i-1][j+1]);
}
}
return dp[prices.size()-1][2*k];
}
};