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 (ie, you must sell the stock before you buy again).

 

Code:

class Solution {public:    int maxProfit(vector
     
       &prices) {        int cur=0;        int maxProf=0;        int tmpProf=0;        for(int i=1;i