leetcode-----122. 买卖股票的最佳时机 II

• 链接：https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-ii/

算法

时间复杂度：(O(n))

代码

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;
   }
};