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.

---

LeetCode：链接

d[i]代表[0,i]内交易股票的最大收益 minPrice表示［0，i）之间价格的最小值。

状态转移方程 dp[i] = max(dp[i-1],prices[i]-minPrice)。

class Solution(object):
    def maxProfit(self, prices):
        """
        :type prices: List[int]
        :rtype: int
        """
        '''dp记录的是最大收益'''
        dp = [0] * len(prices)
        '''记录出现过的最小买入价格'''
        min_price = prices[0]
        for i in range(1, len(prices)):
            '''当前价格和之前最小买入价格求最小值'''
            min_price = min(min_price, prices[i])
            dp[i] = max(dp[i-1], prices[i]-min_price)
        return dp[-1]