122. Best Time to Buy and Sell Stock II

122. Best Time to Buy and Sell Stock II

https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/

Description

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

Solutions

我的思路很复杂，就是和前面一道一样，记录minprice，如果prices[i] < minprice，则更新minprice，否则判断一下prices[i] > prices[i+1]，看是不是个峰，是峰就卖。
这样就有个问题，最后一个prices[prices.length-1]遍历不到（这样的判断会溢出），需要在遍历完后单独再判断一下。而且这个判断要注意prices.length>1，防止[]的情况进入判断。

Submissions

一：

class Solution {
    public int maxProfit(int[] prices) {
        int minprice = Integer.MAX_VALUE;
        int maxprofit = 0; 
        int profit = 0;
        for (int i = 0; i < prices.length-1; i++) {           
            if (prices[i] < minprice)
                minprice = prices[i];
            else if (prices[i] > prices[i+1])
            {
                profit = prices[i] - minprice;
                maxprofit+=profit;
                profit=0;
                minprice = Integer.MAX_VALUE;
            }
        }
        if(prices.length>1&&minprice<prices[prices.length-1])
        {
            profit = prices[prices.length-1] - minprice;
            maxprofit+=profit;
        }
            
        return maxprofit;
    }
}

二：

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

Summary

答案的方法很简单，只要prices[i]>prices[i-1]，就加起来，弱化一买一卖的操作，关注profit的计算结果的规律。