
class Solution {
public int maxProfit(int\[\] prices) {
int l = prices.length;
int max = 0;
int minNum = prices0;
for (int i = 0;i< l;i++) {
minNum = Math.min(pricesi, minNum);
max = Math.max(max, (pricesi - minNum));
}
return max;
}
}

class Solution {
public int maxProfit(int\[\] prices) {
int l = prices.length;
int max = 0;
int minNum = prices0;
for (int i = 0;i< l;i++) {
minNum = Math.min(pricesi, minNum);
max = Math.max(max, (pricesi - minNum));
}
return max;
}
}