题目:
Say you have an array for which the ith element is the price of a given stock on day i.
Design an algorithm to find the maximum profit. You may complete as many transactions as you like (ie, buy one and sell one share of the stock multiple times). However, you may not engage in multiple transactions at the same time (ie, you must sell the stock before you buy again).
分析:
一连串的数字只能在卖出之后才能买入。只需要考虑当前的利润是最高的即可。
代码:
class Solution {
public:
int maxProfit(vector<int>& prices) {
int size=prices.size();
if(size<1)return 0;
int totalpro=0,curpro=0,prestock=INT_MAX;
for(int i=0;i<size;++i){
if(prices[i]<prestock){
totalpro+=curpro;
curpro=0;
}else curpro=prices[i]-prestock+curpro;
prestock=prices[i];
}
totalpro+=curpro;
return totalpro;
}
};