原题目:https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-ii/
思路:
扫描数组,如果今天的而价格比昨天的高,就卖出
代码:
class Solution {
public:
int maxProfit(vector<int>& prices) {
int ans = 0;
for(int i=1;i<prices.size();i++){
if(prices[i] > prices[i-1]){
ans += prices[i]-prices[i-1];
}
}
return ans;
}
};