[勇者闯LeetCode] 121. Best Time to Buy and Sell Stock

[勇者闯LeetCode] 121. Best Time to Buy and Sell Stock

Description

Say you have an array for which the $i^{th}$ element is the price of a given stock on day i <script type="math/tex" id="MathJax-Element-54">i</script>.

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

Example 1:

Input: [7, 1, 5, 3, 6, 4]
Output: 5

max. difference = 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

In this case, no transaction is done, i.e. max profit = 0.

Information

• Tags: Array | Dynamic Programming
• Difficulty: Easy

Solution

在扫描过程记录最低位的价格和当前能得到的最大收益。

Python Code

class Solution(object):
    def maxProfit(self, prices):
        """
        :type prices: List[int]
        :rtype: int
        """
        ans = 0 
        if prices:
            low = prices[0]
            for price in prices[1:]:
                ans = max(ans, price - low)
                low = min(low, price)
        return ans