Leetcode 123. Best Time to Buy and Sell Stock III

123. Best Time to Buy and Sell Stock III

• Total Accepted: 64481
• Total Submissions: 236301
• Difficulty: Hard

 

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.

 

思路：DP，主要是状态的转移。

 

代码：为了节省内存，buy1写在sell1后面，buy2写在sell2后面

 1 class Solution {
 2 public:
 3     int maxProfit(vector<int>& prices) {
 4         int len=prices.size();
 5         //buy1:one buy  buy2:two buy,one sell
 6         //sell1:one buy,one sell  sell2:two buy,two sell
 7         int buy1=INT_MIN,buy2=INT_MIN,sell1=0,sell2=0;
 8         for(int i=0;i<len;i++){
 9             sell1=max(sell1,buy1+prices[i]);
10             buy1=max(buy1,-prices[i]);
11             sell2=max(sell2,buy2+prices[i]);
12             buy2=max(buy2,sell1-prices[i]);
13         }
14         return max(sell1,sell2);
15     }
16 };

 

参考：https://discuss.leetcode.com/topic/19750/my-c-solution-o-n-time-o-1-space-8ms

转载于:https://www.cnblogs.com/Deribs4/p/5798443.html