代码随想录刷题第49天
#include <vector>
using namespace std;
class Solution {
public:
int maxProfit(vector<int>& prices) {
int len = prices.size();
vector<vector<int>> dp(len,vector<int>(5,0));
dp[0][1] = -prices[0];
dp[0][2] = 0;
dp[0][3] = -prices[0];
dp[0][4] = 0;
for (int i = 1; i < len; i++)
{
dp[i][1] = max(dp[i-1][1],-prices[i]);
dp[i][2] = max(dp[i-1][2],dp[i-1][1] + prices[i]);
dp[i][3] = max(dp[i-1][3],dp[i-1][2] - prices[i]);
dp[i][4] = max(dp[i-1][4],dp[i-1][3] + prices[i]);
}
return dp[len-1][4];
}
};
#include <vector>
using namespace std;
class Solution {
public:
int maxProfit(int k, vector<int>& prices) {
int len = prices.size();
vector<vector<int>> dp(len,vector<int>(2*k+1,0));
for (int i = 0; i < k; i++)
{
dp[0][2*i+1] = -prices[0];
}
for (int i = 1; i < len; i++)
{
for (int j = 1; j <2*k+1; j++)
{
if(j % 2 == 1){
dp[i][j] = max(dp[i-1][j],dp[i-1][j-1] - prices[i]);
}else{
dp[i][j] = max(dp[i-1][j],dp[i-1][j-1] + prices[i]);
}
}
}
return dp[len-1][2*k];
}
};