class Solution {
public int maxProfit(int[] prices) {
if (prices.length == 0) {
return 0;
}
int res = 0;
for (int i = 0, min = prices[0]; i < prices.length; i++) {
res = Math.max(res, prices[i] - min);
min = Math.min(min, prices[i]);
}
return res;
}
}