Say you have an array for which the ith element is the price of a given stock on day i

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).

还没有评论

举报纠错

切换

1 个答案

class Solution { public: int maxProfit(vector &p) { if(p.size()==0||p.size()==1) return 0; if(p.size()==2) return max(0,p[1]-p[0]); int Max=-9999,k; for(k=0;k &p,int i,int j) { int xl[1000],k,Min=9999,Max=-9999; for(k=i;k<=j;k++) { Min=min(Min,p[k]); xl[k]=Min; } for(k=i;k<=j;k++) Max=max(Max,p[k]-xl[k]); return Max; } };

还没有评论

切换

撰写答案

扫描后移动端查看本题

我也分享一个题目