题目链接:https://leetcode.cn/problems/gu-piao-de-zui-da-li-run-lcof/description/?favorite=xb9nqhhg&orderBy=hot
代码:
class Solution {
public:
int dp[100005];
int maxProfit(vector<int>& prices) {
if(prices.size()==0)
{
return 0;
}
int maxx=0;
int min=prices[0];
for(int i=1;i<prices.size();i++)
{
dp[i]=max(dp[i-1],prices[i]-min);
if(prices[i]<min)
{
min=prices[i];
}
printf("%d-----%d\n",dp[i],min);
}
return dp[prices.size()-1];
}
};