121. 买卖股票的最佳时机
class Solution {
public:
int maxProfit(vector<int>& prices) {
int size = prices.size();
if(size == 0){
return 0;
}
vector<vector<int>> dp(size, vector<int>(2, 0));
for(int i = 0; i < size; i++){
if(i == 0){
dp[i][0] = 0;
dp[i][1] = -prices[i];
continue;
}
dp[i][0] = max(dp[i-1][0], dp[i-1][1]+prices[i]);
dp[i][1] = max(dp[i-1][1], dp[0][0]-prices[i]);
}
return dp[size-1][0];
}
};
122. 买卖股票的最佳时机 II
class Solution {
public:
int maxProfit(vector<int>& prices) {
int size = prices.size();
if(size == 0){
return 0;
}
vector<vector<int>> dp(size, vector<int>(2, 0));
for(int i = 0; i < size; i++){
if(i == 0){
dp[i][0] = 0;
dp[i][1] = -prices[i];
continue;
}
dp[i][1] = max(dp[i-1][1], dp[i-1][0]-prices[i]);
dp[i][0] = max(dp[i-1][0], dp[i-1][1]+prices[i]);
}
return dp[size-1][0];
}
};
123. 买卖股票的最佳时机 III
class Solution {
public:
int maxProfit(vector<int>& prices) {
int size = prices.size();
if(size == 0){
return 0;
}
int max_k = 2;
int dp[size][max_k+1][2];
memset(dp, 0, sizeof(dp));
for(int i = 0; i < size; i++){
for(int k = max_k; k >= 1; k--){
if(i == 0){
dp[0][k][0] = 0;
dp[i][k][1] = -prices[0];
continue;
}
dp[i][k][0] = max(dp[i-1][k][0], dp[i-1][k][1]+prices[i]);
dp[i][k][1] = max(dp[i-1][k][1], dp[i-1][k-1][0]-prices[i]);
}
}
return dp[size-1][max_k][0];
}
};
188. 买卖股票的最佳时机 IV
class Solution {
public:
int maxProfit(int k, vector<int>& prices) {
int size = prices.size();
if(size == 0){
return 0;
}
if(k > size/2){
return kInfProfit(prices);
}
int dp[size][k+1][2];
memset(dp, 0, sizeof(dp));
for(int i = 0; i < size; i++){
for(int kk = k; kk >= 1; kk--){
if(i == 0){
dp[i][kk][0] = 0;
dp[i][kk][1] = -prices[0];
continue;
}
dp[i][kk][0] = max(dp[i-1][kk][0], dp[i-1][kk][1]+prices[i]);
dp[i][kk][1] = max(dp[i-1][kk][1], dp[i-1][kk-1][0]-prices[i]);
}
}
return dp[size-1][k][0];
}
int kInfProfit(vector<int>& prices){
int size = prices.size();
int dp[size][2];
memset(dp, 0, sizeof(dp));
for(int i = 0; i < size; i++){
if(i == 0){
dp[i][0] = 0;
dp[i][1] = -prices[i];
continue;
}
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]);
}
return dp[size-1][0];
}
};
309. 最佳买卖股票时机含冷冻期
class Solution {
public:
int maxProfit(vector<int>& prices) {
int size = prices.size();
if(size == 0){
return 0;
}
int dp[size][2];
memset(dp, 0, sizeof(dp));
for(int i = 0; i < size; i++){
if(i == 0){
dp[i][0] = 0;
dp[i][1] = -prices[0];
continue;
}
if(i == 1){
dp[i][0] = max(dp[i-1][0], dp[i-1][1]+prices[i]);
dp[i][1] = max(dp[i-1][1], dp[0][0]-prices[i]);
continue;
}
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[size-1][0];
}
};
714. 买卖股票的最佳时机含手续费
class Solution {
public:
int maxProfit(vector<int>& prices, int fee) {
int size = prices.size();
if(size == 0){
return 0;
}
int dp[size][2];
for(int i = 0;i < size;i++){
if(i == 0){
dp[i][0] = 0;
dp[i][1] = -prices[i]-fee;
continue;
}
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 dp[size-1][0];
}
};