/*
记录第i个元素之前的最小值,第i元素与最小值的差值的最大值便求得最大利润
*/
class Solution {
public int maxProfit(int[] prices) {
int min = Integer.MAX_VALUE;
int res = 0;
for (int i = 0; i < prices.length; i++) {
res = Math.max(res, prices[i] - min);
min = Math.min(min, prices[i]);
}
return res;
}
}