121. Best Time to Buy and Sell Stock

121. Best Time to Buy and Sell Stock

Easy

8955376Add to ListShare

You are given an array prices where prices[i] is the price of a given stock on the ith day.

You want to maximize your profit by choosing a single day to buy one stock and choosing a different day in the future to sell that stock.

Return the maximum profit you can achieve from this transaction. If you cannot achieve any profit, return 0.

 

Example 1:

Input: prices = [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.
Note that buying on day 2 and selling on day 1 is not allowed because you must buy before you sell.

Example 2:

Input: prices = [7,6,4,3,1]
Output: 0
Explanation: In this case, no transactions are done and the max profit = 0.

 

Constraints:

• 1 <= prices.length <= 105
• 0 <= prices[i] <= 104

class Solution:
    def maxProfit(self, prices: List[int]) -> int:
        """
        assert Solution().maxProfit([7, 1, 5, 3, 6, 4]) == 5
        assert Solution().maxProfit([7, 6, 4, 3, 1]) == 0
        解题思路：遍历一遍不断更新最小的值，更新当前值与最小值的最大正差值。
        时间复杂度：O(n)，空间复杂度：O(1)
        """
        if prices is None or len(prices) <= 1:
            return 0
        res = 0
        min_price = prices[0]
        for price in prices[1:]:
            res = max(res, price - min_price)
            if price < min_price:
                min_price = price
        return res