class Solution {
public int maxProfit(int[] prices) {
if(prices.length==0||prices.length==1){
return 0;
}
int previous=prices[0];
int sum=0;
for(int i=0;i<prices.length;i++){
int now=prices[i];
if(now>previous){
sum+=now-previous;
}
previous=prices[i];
}
return sum;
}
}
Java#买卖股票的最佳时机
猜你喜欢
转载自blog.csdn.net/Iverson941112/article/details/97814871
今日推荐
周排行