首页 > 代码库 > Best Time to Buy and Sell Stock III
Best Time to Buy and Sell Stock III
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
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。