LeetCode: Best Time to Buy and Sell Stock II

题目：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 len = prices.size();
        if (len < 2) return 0;
        
        int sum = 0;
        for (int i = 1; i < len; ++i) {
            if (prices[i] - prices[i - 1] > 0) sum += prices[i] - prices[i - 1];
        }
        
        return sum;
    }
};