您的位置:首页 > 其它

188. Best Time to Buy and Sell Stock IV

2016-11-14 07:20 393 查看
Say you have 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.

Note:

You may not engage in multiple transactions
4000
at the same time (ie, you must sell the stock before you buy again).
内容来自用户分享和网络整理,不保证内容的准确性,如有侵权内容,可联系管理员处理 点击这里给我发消息
标签: