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

Subscribe to see which companies asked this question

---

翻译

对于每一笔交易 假设是从i天买入 j天卖出 ，如果有j+1天的价格高于j天，所以肯定是从i到j+1利润更高，同样的如果有第i-1天价格比第i天更低，肯定是从i-1天到j天利润更高。

---

源码

JavaScript

/**
 * @param {number[]} prices
 * @return {number}
 */
var maxProfit = function(prices) {
    if(prices.length<2) return 0;
    var sum=0;
    for(var i=0;i<prices.length;i++) {  
        if(prices[i]>prices[i-1]){
            sum=sum+(prices[i]-prices[i-1]);
        }
    }
    return sum;

};