题目链接:LeeCode121买卖股票的最佳时机
题目描述:
当前天最大盈利是今天价格减之前天里最小的价格,依次找
class Solution {
public static int maxProfit(int[] prices) {
int n=prices.length;
int index=0;
int max=0;
for (int i = 0; i < n; i++) {
if(prices[i]<prices[index]) index=i;
if(prices[i]-prices[index]>max) max=prices[i]-prices[index];
}
return max;
}
}