class Solution {
public:
int maxProfit(vector<int>& prices) {
int maxCur = 0, maxAll = 0;
if(prices.size() <= 1) return 0;
auto i = prices.begin();
++i;
for(; i != prices.end(); ++i) {
maxCur = max(0, maxCur += *i - *(--i));
maxAll = max(maxCur, maxAll);
++i;
}
return maxAll;
}
};

posted on 2017-11-12 16:21  bloomingFlower  阅读(112)  评论(0编辑  收藏  举报