leetcode 腾讯精选练习（50 题）122.买卖股票的最佳时机 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 (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.

思路

边界条件：prices == None 或者 prices == []

贪心算法，遍历整个数组，如果当前价格位于最小价格和最大价格之间，那么采集前面的最大利润，然后把当前价格最为最小价格继续遍历，同时利润置零。

第一遍解法

# Runtime: 36 ms, faster than 96.12% of Python3  O(n)
# Memory Usage: 14 MB, less than 44.39% of Python3  S(1)
class Solution:
    def maxProfit(self, prices):
        if prices == None or prices == []:
            return 0
        min_price, profit, res = prices[0], 0, 0
        for price in prices[1:]:
            if price - min_price >= profit:
                profit = price - min_price
            else:
                res += profit
                min_price = price
                profit = 0
        res += profit
        return res

网上好的解法

自己可以改进的地方

最简代码

获得的思考