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