题目:
![](https://i-blog.csdnimg.cn/blog_migrate/e462f217f1e5bd4388fc27adc2b60b2b.png)
代码(首刷看解析 2024年2月29日):
class Solution {
public:
//动态规划
int maxProfit(vector<int>& prices) {
int n = prices.size();
vector<vector<int>> dp(n + 1,vector<int>(5, 0));
dp[0][1] = -prices[0];
dp[0][3] = -prices[0];
for (int i = 1; i <= n; ++i) {
dp[i][1] = max(dp[i - 1][0] - prices[i - 1], dp[i - 1][1]);
dp[i][2] = max(dp[i - 1][1] + prices[i - 1], dp[i - 1][2]);
dp[i][3] = max(dp[i - 1][2] - prices[i - 1], dp[i - 1][3]);
dp[i][4] = max(dp[i - 1][3] + prices[i - 1], dp[i - 1][4]);
}
return dp[n][4];
}
};
![](https://i-blog.csdnimg.cn/blog_migrate/de6691b94c251c1ed79d3d99b3e98750.png)