class Stock {
public:
int maxProfit(vector<int> prices, int n) {
int max=0;
int peakBeaseBefore,peakBeaseAfter;
for(int i=0;i<n;i++)
{
peakBeaseBefore=0;peakBeaseAfter=0;
for(int j=0;j<i;j++)
{
for(int m=0;m<j;m++)
{
if((prices[j]-prices[m])>peakBeaseBefore)
{
peakBeaseBefore=prices[j]-prices[m];
}
}
}
for(int k=i+1;k<n;k++)
{
if((prices[k]-prices[i])>peakBeaseAfter)
{
peakBeaseAfter=prices[k]-prices[i];
}
}
if((peakBeaseBefore+peakBeaseAfter)>max)
{
max=peakBeaseBefore+peakBeaseAfter;
}
}
return max;
}
};
思想来源于动态规划,如果以arr[i]为第二个投资点,那么,必须找到i-1前面的最大投资收益