123. Best Time to Buy and Sell Stock III

最新推荐文章于 2024-01-20 11:34:17 发布

站在风口的熊

最新推荐文章于 2024-01-20 11:34:17 发布

阅读量118

点赞数

分类专栏： leetcode&poj 文章标签： leetcode Best Time to Buy and Sell Stoc

本文链接：https://blog.csdn.net/barebear007/article/details/79558749

版权

leetcode&poj 专栏收录该内容

83 篇文章 0 订阅

订阅专栏

class Solution {
public:
int maxProfit(vector<int>& prices) {
vector<vector<int>> maxProfits(prices.size(),vector<int>(2,0));
int maxPos = prices.size() - 1;
if(maxPos <= 0 ) return 0;
maxProfits[0][0] = 0;
maxProfits[0][1] = prices[0];//top
maxProfits[0][2] = prices[0];//bottom

for(int i=1;i<=maxPos;i++){
//maxProfits[i][0] = max(maxProfits[i-1][0],max(maxProfits[i-1][1]-prices[i],prices[i] - maxProfits[i-1][2]));
maxProfits[i][0] = max(maxProfits[i-1][0],prices[i] - maxProfits[i-1][2]);
maxProfits[i][2] = prices[i]<maxProfits[i-1][2] ? prices[i] : maxProfits[i-1][2];
}


vector<vector<int>> maxProfits1(prices.size(),vector<int>(2,0));

if(maxPos <= 0 ) return 0;
maxProfits1[maxPos][0] = 0;
maxProfits1[maxPos][1] = prices[maxPos];//top
maxProfits1[maxPos][2] = prices[maxPos];//bottom

for(int i=maxPos-1;i>=0;i--){

maxProfits1[i][0] = max(maxProfits1[i+1][0],maxProfits1[i+1][1] - prices[i]);
maxProfits1[i][1] = prices[i]>maxProfits1[i+1][1] ? prices[i] : maxProfits1[i+1][1];
}

int total = maxProfits1[0][0];//执行一次操作
for(int i=2;i<=maxPos-1;i++){
total = max(total,maxProfits[i-1][0] + maxProfits1[i][0] );
}
return total;
}


};