Sliding Window
02. Best Time to Buy and Sell Stock
You are given an array prices where prices[i] is the price of a given stock on the i-th 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.
Examples
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 <= 10^5
- 0 <= prices[i] <= 10^4
from typing import List
days: List[int] = [5, 7, 2, 1, 7]
profit: int = 0
buy: int
sell: int
buy, sell = 0, 1
while sell < len(days):
if days[sell] > days[buy]:
new_profit: int = days[sell] - days[buy]
profit = max(profit, new_profit)
else:
buy = sell # Found a lower price, update buy day
sell += 1
print(profit)Keyboard shortcuts
← h Previous problem
→ l Next problem
Esc Back to index
? Toggle this help