LeetCode 309.最佳买卖股票时机含冷冻期
题目链接:
LeetCode 309.最佳买卖股票时机含冷冻期
代码:
class Solution {
public:
int maxProfit(vector<int>& prices) {
int size = prices.size();
vector<vector<int>>dp(size+1,vector<int>(4,0));
dp[0][0] = -prices[0];
//0 买入
//1保持卖出
//2卖出
//3冷冻
//
for(int i=1;i<size;i++){
dp[i][0] = max(dp[i-1][0],max(dp[i-1][1]-prices[i],dp[i-1][3]-prices[i]));
dp[i][1] = max(dp[i-1][1],dp[i-1][3]);
dp[i][2] = dp[i-1][0]+prices[i];
dp[i][3] = dp[i-1][2];
}
return max(dp[size - 1][3], max(dp[size - 1][1], dp[size - 1][2]));
}
};
LeetCode 714.买卖股票的最佳时机含手续费
题目链接:
LeetCode 714.买卖股票的最佳时机含手续费
代码:
class Solution {
public:
int maxProfit(vector<int>& prices, int fee) {
int size = prices.size();
vector<vector<int>>dp(size,vector<int>(2,0));
dp[0][0] -= prices[0]; // 持股票
for(int i=1;i<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 max(dp[size - 1][0], dp[size - 1][1]);
}
};