Documentation Index
Fetch the complete documentation index at: /llms.txt
Use this file to discover all available pages before exploring further.
Tested Python solution for LeetCode 121 with 15 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 121 # by problem number
lcpy gen -s best_time_to_buy_and_sell_stock # by problem name
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.
Input: prices = [7,1,5,3,6,4]
Output: 5
Input: prices = [7,6,4,3,1]
Output: 0
class Solution:
# Time: O(n)
# Space: O(1)
def max_profit(self, prices: list[int]) -> int:
min_price = prices[0]
max_profit = 0
for price in prices[1:]:
max_profit = max(max_profit, price - min_price)
min_price = min(min_price, price)
return max_profit
| Time | Space |
|---|---|
| O(n) | O(1) |