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).
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).
相关文章推荐
- 188 Best Time to Buy and Sell Stock IV
- leetcode_188 Best Time to Buy and Sell Stock IV
- 188. Best Time to Buy and Sell Stock IV
- 188. Best Time to Buy and Sell Stock IV
- [leetcode] 188. Best Time to Buy and Sell Stock IV 解题报告
- leetcode_[python/C++]_121/122/123/188.Best Time to Buy and Sell Stock I/II/III/IV
- leetcode(121)(122)(123)(188) Best Time to Buy and Sell Stock I/II/III/IV JAVA代码
- LeetCode 188 Best Time to Buy and Sell Stock IV (动态规划 推荐)
- Java for LeetCode 188 Best Time to Buy and Sell Stock IV【HARD】
- leetcode 188---Best Time to Buy and Sell Stock IV
- LeetCode188:Best Time to Buy and Sell Stock IV
- LeetCode #188: Best Time to Buy and Sell Stock IV
- leecode 解题总结:188. Best Time to Buy and Sell Stock IV
- Leetcode 188 Best Time to Buy and Sell Stock IV 至多k次买卖股票最大收益
- Hard-题目38:188. Best Time to Buy and Sell Stock IV
- 188. Best Time to Buy and Sell Stock IV (Array; DP)
- LeetCode(188) Best Time to Buy and Sell Stock IV
- LeetCode(188) Best Time to Buy and Sell Stock IV (Java)
- 188. Best Time to Buy and Sell Stock IV
- 188. Best Time to Buy and Sell Stock IV