LeetCode 123. Best Time to Buy and Sell Stock III--Python解法--动态规划--数学题

此文首发于我的个人博客：zhang0peter的个人博客

---

LeetCode题解文章分类：LeetCode题解文章集合
LeetCode 所有题目总结：LeetCode 所有题目总结

---

题目地址：Best Time to Buy and Sell Stock III - LeetCode

---

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 two transactions.

Note: You may not engage in multiple transactions at the same time (i.e., you must sell the stock before you buy again).

Example 1:

Input: [3,3,5,0,0,3,1,4]
Output: 6
Explanation: Buy on day 4 (price = 0) and sell on