Leetcode Best Time to Buy and Sell Stock python 问题解析

Leetcode 121题 Best Time to Buy and Sell Stock

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.

题目大意： 给出一组序列，是股票的价格走势，问什么时候买，什么时候卖，能获得最大收益。 输出最大收益。

---

解法一：
很容易想到，循环起来，设置两个变量。一个一直更新最小值，一个一直更新循环出来的数减去最小值的最大收益。 最后输出最大收益即可。

class Solution:
    def maxProfit(self, prices: List[int]) -> int:
        if len(prices) < 2: #小于2即不构成买卖，就没有收益。
            return 0
        minPrice = prices[0]  #一直记录最小值得变量。
        maxProfit = 0  #一直更新最大收益。
        for p in prices:  #循环起来。
            if p < minPrice: #如果当前值比最小值还小。
                minPrice = p #更新最小值。
            elif p - minPrice > maxProfit: 
                maxProfit = p - minPrice
        return maxProfit

解法二：
动态规划，制作一个最大收益的列表并排序，然后输出最后一个值。思路跟上一个大体相同。

class Solution:
    def maxProfit(self, prices: List[int]) -> int:
        if len(prices) < 2:
            return 0
        minPrice = prices[0]
        dp = [0] * len(prices)  #定义动态规划列表。存放最大收益。
        for i in range(0, len(prices)):
            dp[i] = max(dp[i-1], prices[i] - minPrice) #往动态规划列表里填内容。默认按从小到大排序。
            minPrice = min(minPrice, prices[i])
        return dp[-1]

优化的代码：

class Solution:
    def maxProfit(self, prices: List[int]) -> int:
        if not prices: return 0
        minPrice = float('inf')
        profit = 0
        for price in prices:
            minPrice = min(minPrice, price)
            profit = max(profit, price - minPrice)
        return profit

这样看起来舒服很多。
不过还是思路一效率高。

2020/03/11
英国，晚，雨。加油！