leetcode121-python 买卖股票最佳时机

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.

---

解题要点：

1.本来准备通过两次循环，一个找买入的点，一个找卖出的点，但是发现数据很大时超时了，所以改为一次循环；

class Solution:
    def maxProfit(self, prices):
        """
        :type prices: List[int]
        :rtype: int
        """
        n = len(prices)
        if n == 0 or n == 1:
            return 0
        minbuy = prices[0]
        maxprof = 0
        for i in range(1,n):
            minbuy = min(minbuy, prices[i])
            maxprof = max(maxprof, prices[i]-minbuy)
        # if maxprof == 0:
        #     return 0
        return maxprof