Leetcode Problem 123. Best Time to Buy and Sell Stock III
Leetcode Solutions
Approach: One-pass Simulation
- Initialize
t1_costtoinfinityandt1_profitto0. - Initialize
t2_costtoinfinityandt2_profitto0. - Iterate through each price in the
pricesarray. a. Updatet1_costto be the minimum of the currentt1_costand the current price. b. Updatet1_profitto be the maximum of the currentt1_profitand the current price minust1_cost. c. Updatet2_costto be the minimum of the currentt2_costand the current price minust1_profit. d. Updatet2_profitto be the maximum of the currentt2_profitand the current price minust2_cost. - Return
t2_profitas the maximum profit that can be achieved with at most two transactions.
Approach: Bidirectional Dynamic Programming
Ask Question
Programming Language
Purpose:
image/screenshot of info(optional)
Full Screen
Loading...
Suggested Answer
Answer
Full Screen
Copy Answer Code
Loading...