标签：des style blog io ar color os sp for
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).
class Solution { public: int maxProfit(vector<int> &prices) { if (prices.size() <= 1) return 0; else { int K = 2; // number of max transation allowed int maxProf = 0; vector<vector<int>> f(K+1, vector<int>(prices.size(), 0)); for (int kk = 1; kk <= K; kk++) { int tmpMax = f[kk-1][0] - prices[0]; for (int ii = 1; ii < prices.size(); ii++) { f[kk][ii] = max(f[kk][ii-1], prices[ii] + tmpMax); tmpMax = max(tmpMax, f[kk-1][ii] - prices[ii]); maxProf = max(f[kk][ii], maxProf); } } return maxProf; } } };
Best Time to Buy and Sell Stock III
标签：des style blog io ar color os sp for
原文地址：http://www.cnblogs.com/code-swan/p/4141098.html
