Buy/Sell Stock With K transactions To Maximize Profit Dynamic Programming

Опубликовано: 06 Январь 2016
на канале: Tushar Roy - Coding Made Simple
178,041
2.2k

  / tusharroy25  
https://github.com/mission-peace/inte...
https://github.com/mission-peace/inte...
https://github.com/mission-peace/inte...

Given an array for which the ith element is the price of a given stock on day i.
Design an algorithm to find the maximum profit. You may complete at most k transactions. Transactions cannot occur in parallel. One transaction should complete before starting another transaction.