leetcode 腾讯精选练习（50 题）121.买卖股票的最佳时机

原题目

Say you have an array for which the ith element is the price of a given stock on day i.

If you were only permitted to complete at most one transaction (i.e., buy one and sell one share of the stock), design an algorithm to find the maximum profit.

Note that you cannot sell a stock before you buy one.

Example 1:

Input: [7,1,5,3,6,4]
Output: 5
Explanation: Buy on day 2 (price = 1) and sell on day 5 (price = 6), profit = 6-1 = 5.
             Not 7-1 = 6, as selling price needs to be larger than buying price.

Example 2:

Input: [7,6,4,3,1]
Output: 0
Explanation: In this case, no transaction is done, i.e. max profit = 0.

思路

边界条件：prices == None

初始 profit = 0，min_price 表示遍历过的价格中的最低价格，如果当前价格大于等于 min_price 作差和 profit 比较，若差值大于 profit 将差值给 profit。如果当前价格小于 min_price，当前价格赋值给 min_price

第一遍解法

# Runtime: 32 ms, faster than 99.44% of Python3  O(n)
# Memory Usage: 13.9 MB, less than 71.42% of Python3  S(1)
class Solution:
    def maxProfit(self, prices):
        if prices == None or prices == []:
            return 0
        profit, min_price = 0, prices[0]
        for price in prices[1:]:
            if price >= min_price:  # 价格大于等于最低价格
                profit = max(price-min_price, profit)
            else:  # 价格小于最低价格
                min_price = price
        return profit

网上好的解法

自己可以改进的地方

最简代码

获得的思考