Best Time to Buy and Sell Stock II

Say you have an array for which the i^th 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).

不要被ii，吓到了，其实比前面那个还简单。可以多次。那只需把每次递增的加起来即可！

// 累加所有递增的值即可！！    int maxProfit(vector<int> &prices) {                if(prices.size() <= 1)return 0;                       int profit_sum = 0;                for(int i = 1;i < prices.size();i++)        {            if(prices[i] - prices[i-1] > 0)            {                 profit_sum +=  prices[i] - prices[i-1];            }        }                return profit_sum;            }