Leetcode121 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.

解答：大家基本上都是用DP来求解本题的，其实现在我对动态规划压根就还不理解，感觉挺难的。先在记录一下大概思路，总有一天会理解的，也不会太远。就是假如给定一个数组[7,1,5,3,6,4]，那么他们对应当天最低的买入价格分别为[7,1,1,1,1,1],那么我们可以得到对应时间的收益分别是[0,1,4,2,5,3]。

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