Leetcode Best Time to Buy and Sell Stock II Python | 多次买卖股票求收益问题

Leetcode 122题 Best Time to Buy and Sell Stock II
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 * 10 ^ 4
0 <= prices[i] <= 10 ^ 4

---

题目大意：
是股票买卖题的第二个版本，之前是只能在一个数组中相减一次找一个最大值；现在是遍历一遍，可进行多次买卖，找一个最大值，并且只能卖了再买。

这道题就怕想太多，其实只要能赚钱，买了就卖。 不用考虑是不是局部最大值之类的问题。这样就很容易了。

class Solution:
    def maxProfit(self, prices: List[int]) -> int:
        if not prices: return 0
        result = 0
        for i in range(len(prices) - 1):
            if prices[i+1] > prices[i]:
                result += prices[i+1] - prices[i]
        return result

怎么觉得比第I版本的问题还简单了呢。

06/05/2020
疫情中的英国，
加油！