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 123 with 23 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 123 # by problem number
lcpy gen -s best_time_to_buy_and_sell_stock_iii # by problem name
prices where prices[i] is the price of a given stock on the i^th day.
Find the maximum profit you can achieve. You may complete at most two transactions.
Note: You may not engage in multiple transactions simultaneously (i.e., you must sell the stock before you buy again).
Input: prices = [3,3,5,0,0,3,1,4]
Output: 6
Input: prices = [1,2,3,4,5]
Output: 4
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:
buy1 = buy2 = -(10**18)
sell1 = sell2 = 0
for price in prices:
buy1 = max(buy1, -price)
sell1 = max(sell1, buy1 + price)
buy2 = max(buy2, sell1 - price)
sell2 = max(sell2, buy2 + price)
return sell2
| Time | Space |
|---|---|
| O(n) | O(1) |