121. 买卖股票的最佳时机
class Solution {
public:
int maxProfit(vector<int>& prices) {
int res =0;
int money = 0;
for(int i=1; i<prices.size(); i++)
{
if(prices[i]-prices[i-1]+money<0) money =0;
else money += prices[i]-prices[i-1];
res = max(res, money);
}
return res;
}
};
122.买卖股票的最佳时机II
class Solution {
public:
int maxProfit(vector<int>& prices) {
int res =0;
for(int i=1; i<prices.size(); i++)
{
if(prices[i]- prices[i-1]>0) res += prices[i]-prices[i-1];
}
return res;
}
};