腾讯五十题 No.26 买卖股票的最佳时机
class Solution {
public int maxProfit(int[] prices) {
if(prices.length <= 1)
return 0;
int low = prices[0],res = 0;
for(int i=1;i<prices.length;i++){
low = Math.min(low,prices[i]);
res = Math.max(res,prices[i] - low);
}
return res;
}
}
本文来自博客园,作者:蹇爱黄,转载请注明原文链接:https://www.cnblogs.com/jianjiana/p/15869129.html