122. Best Time to Buy and Sell Stock II

站在风口的熊

于 2018-03-14 16:30:47 发布

阅读量149

点赞数

CC 4.0 BY-SA版权

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

本文链接：https://blog.youkuaiyun.com/barebear007/article/details/79556575

leetcode&poj 专栏收录该内容

83 篇文章

订阅专栏

本文介绍了一个C++实现的算法，该算法用于计算给定股价数组中通过多次买卖所能获得的最大利润。通过跟踪股价的波动趋势，算法能够识别买入和卖出的最佳时机。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

class Solution {
public:
int maxProfit(vector<int>& prices) {

int maxPos = prices.size() - 1;
if(maxPos < 0 ) return 0;

int maxTemp = 0 ;//短线的上升沿最大值
int minTemp = 0;//短线的上升沿的最小值
bool climbing = prices[1]-prices[0]>=0 ? true : false ;
if(climbing){
minTemp = prices[0];
maxTemp = prices[1];
}else{
minTemp = prices[1];
maxTemp = prices[1];
}
int total = 0;
int i=2;
for(;i<=maxPos;i++){
if(prices[i]-prices[i-1]>=0){
if(climbing){
maxTemp = prices[i];
}else{
minTemp = prices[i-1];
maxTemp = prices[i];
climbing = true;
}
}
if(prices[i]-prices[i-1]<0){
if(climbing){
total += prices[i-1] - minTemp;
climbing = false;
minTemp = prices[i];
maxTemp = prices[i];
}else{
minTemp = prices[i];
maxTemp = prices[i];
}
}


}
if(climbing && i>maxPos){
total += prices[i-1] - minTemp;
}
return total;
}
};