leetCode刷题记录21_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 
(i.e., buy one and sell one share of the stock multiple times).
Note: You may not engage in multiple transactions at the same time (i.e., you must sell the stock before you buy again).
Example 1:
    Input: [7,1,5,3,6,4]
    Output: 7
    Explanation: Buy on day 2 (price = 1) and sell on day 3 (price = 5), profit = 5-1 = 4.
             Then buy on day 4 (price = 3) and sell on day 5 (price = 6), profit = 6-3 = 3.
Example 2:
    Input: [1,2,3,4,5]
    Output: 4
    Explanation: Buy on day 1 (price = 1) and sell on day 5 (price = 5), profit = 5-1 = 4.
             Note that you cannot buy on day 1, buy on day 2 and sell them later, as you are
             engaging multiple transactions at the same time. You must sell before buying again.
Example 3:
    Input: [7,6,4,3,1]
    Output: 0
    Explanation: In this case, no transaction is done, i.e. max profit = 0.
还是最大收益问题，和上一个类似，但是可以反复买，只不过买前必须把已买过的卖掉    
/*****************************************************我的解答*************************************************
/**
 * @param {number[]} prices
 * @return {number}
 */
var maxProfit = function(prices) 
{
    var retMaxProfit = 0;
    for(var index = 0; index < prices.length - 1; index++)
    {
        if(prices[index + 1] > prices[index])
        {
            retMaxProfit += prices[index + 1] - prices[index];
        }    
    }    
    return retMaxProfit;
};
想了半天没思路，去讨论区看了一下，看到这个解答，太他妈巧妙了，虽然是野路子，但得到的结果确实
是对的，思路就是结合图形分析，最后结果就是所有上升段的和。看来算法真得好好学学了。