[leetcode] 122. Best Time to Buy and Sell Stock II 解题报告

题目链接：https://leetcode.com/problems/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 sum = 0;
        for(int i =0; i< (int)prices.size()-1; i++)
        {
            int value = prices[i+1] - prices[i];
            if(value > 0) sum += value;
        }
        return sum;
    }
};