public int maxProfit(int[] prices)
{
if(prices.length==0||prices.length==1) return 0;
int sum=0;
int pre=prices[0];
for(int i=1;i<prices.length;i++)
{
int now = prices[i];
if(pre<now)
{
sum+=now-pre;
pre = now;
}
else{
pre = now;
}
}
return sum;
}
leetcode 122 Java
最新推荐文章于 2023-12-03 22:17:18 发布