public int maxProfit(int[] prices) {
if(prices.length<2){
return 0;
}
int re=0;
int low=prices[0];
for(int i=1; i<prices.length; i++){
if(prices[i]<low){
low=prices[i];
}else{
re=Math.max(re, prices[i]-low);
}
}
return re;
}
对这类问题还不太熟悉