[leet code] 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).

一开始的想法是找到最低价格买进, 然后在最高价格卖出得到最大收益, 结果发现得先买后卖 <--错误思路

第二个想法是计算所有可能买卖, 找到受益最大的, 结果超时 O(n*n): <--仍然是错误思路

public class Solution {
    public int maxProfit(int[] prices) {
        if (prices.length == 0) return 0;
        
        int profit = 0;
        int maxProf = 0;
        
        for (int i=0; i<prices.length; i++)
        {
            for (int j=i+1; j<prices.length; j++){
                profit = prices[i] - prices[j];
                if (maxProf < profit) maxProf = profit;
            }
        }
        return maxProf;
    }
}

参考网上做法后发现最大收益可以由所有上升序列差价叠加中获得,即逐次对比i与i+1, 如果i+1>i, 则该次买卖收益为prices[i+1]-prices[i]. O(n). e.g.

2,1,3,5,2,4

做法一: 1入5出, 2入4出

做法二: 1入3出, 3入5出, 2入4出

maxProfit = (3-1) + (5-3) + (4-2) = 6

public class Solution {
    public int maxProfit(int[] prices) {
        if (prices.length == 0) return 0;
        
        int maxProf = 0;
        
        for (int i=0; i<prices.length-1; i++)
        {
            if(prices[i]<prices[i+1]) maxProf = maxProf + (prices[i+1]-prices[i]);
        }
        return maxProf;
    }
}