122. 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).

这一题的样例参考121题，但是这里的意思是，可以进行多次的买入和卖出，但是在买入之前必须先把手中的股票卖出去，所以就等于买入卖出买入卖出买入卖出.......然后参考一个样例:

[7, 1, 2, 5, 3, 6, 4]

显然这里的输入应该是4+3=7。其中4=5-1,3=6-3。但是其实也可以通过2-1+5-2=4。也就是把前后两个数作差，假如大于0的话就加在利润总和里面，在一个递增的数组里，这样的结果总是一致的。而我们的题目就可以看作求其中的所有递增的子序列的最大值减去最小值之和，代码如下：

Code(LeetCode运行6ms):

class Solution {
public:
    int maxProfit(vector<int>& prices) {
        int sum = 0;
        for (int i = 1; i < prices.size(); i++) {
            int sub = prices[i] - prices[i - 1];
            if (sub > 0) {
                sum += sub;
            }
        }
        return sum;
    }
};