[LeetCode]122. Best Time to Buy and Sell Stock II

122. Best Time to Buy and Sell Stock II

一、题目

Problem Description:
Say you have an array prices 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.

Constraints:
$1<=prices.length<=3\ast 10^4$
$0<=prices[i]<=10^4$

二、题解

• 此题是[LeetCode]121. Best Time to Buy and Sell Stock加强版，这题可以多次买卖，但不能同时参与多笔交易（必须在再次购买前出售掉之前的股票），求最大收益。

• 解题思路
  由于可以多次买卖，既可以每天买每天卖。
  若每日操作：卖出前一天股票，买出当天股票。作差结果即为当天利润。
  要想总利润最大，就是将当天利润>0的累加，当天利润<=0的无需操作。

• 举例
  [7,1,5,3,6,4]->[-6,4,-2,3,-2] 前一天买进7，第二天卖出7和买进1，第三天卖出1和买进5，以此类推。
  将[-6,4,-2,3,-2]数组中大于0的元素相加即为所求。

Time complexity : $O(n)$
Space complexity : $O(1)$

//Time complexity : O(n); Space complexity : O(1)
class Solution {
    public int maxProfit(int[] prices) {
        if(prices.length <= 1) return 0;
        for(int i = 1; i < prices.length; i++){
            prices[i-1] = prices[i] - prices[i-1];
        }
        int maxProfit = 0;
        for(int i = 0; i < prices.length - 1; i++){
            if(prices[i] > 0){
                maxProfit += prices[i];
            }
        }
        return maxProfit;
    }
}

当然可以将两个for循环合并成一个for循环，减少时间开销。

//Time complexity : O(n); Space complexity : O(1)
class Solution {
    public int maxProfit(int[] prices) {
        if(prices.length <= 1) return 0;
        int maxProfit = 0;
        for(int i = 1; i < prices.length; i++){
            if(prices[i] - prices[i-1] > 0){
               maxProfit += prices[i] - prices[i-1];
           }
        }
        return maxProfit;
    }
}