Try   HackMD

Best Time to Buy and Sell Stock
Image Not Showing Possible Reasons
  • The image file may be corrupted
  • The server hosting the image is unavailable
  • The image path is incorrect
  • The image format is not supported
Learn More →

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.

Solution

Solution 1: Naive approach

class Solution: def maxProfit(self, prices: List[int]) -> int: # O(n^2). n = len(prices) res = 0 for i in range(n): for j in range(i+1, n): if prices[i] < prices[j] and prices[j] - prices[i] > res: res = prices[j] - prices[i] return res

Solution 2: Sliding windows

  • O(n) time complexity
class Solution: def maxProfit(self, prices: List[int]) -> int: slow, fast = 0, 0 max_profit = 0 while fast < len(prices): if prices[fast] > prices[slow]: max_profit = max(max_profit, prices[fast] - prices[slow]) else: slow = fast fast += 1 return max_profit