Best time to buy and buy stock III Solution

Question requirements:

A maximum of two transactions can be purchased after the purchase.

General idea:

Find an appropriate vertex I in the array to maximize the sum of profit.

Ideas:

1. Scan from left to right. Left [I] records maxprofit in the left part of the record that contains the I element, which can be obtained using best time to buy and buy stock 1.

2. Scan from right to left, right [I] records the maxprofit of the I + 1 to the end element, and change the above low to big.

3. Return max (left [I], right [I]).

Best time to buy and buy stock III Solution