class Solution {
public int maxProfit(int[] prices) {
int min = Integer.MAX_VALUE;
int maxProfit = 0;
for(int i = 0 ; i < prices.length ; i++){
//找出最小值
if(prices[i] < min){
min = prices[i];
//找出最小值以后计算最大利润
}else if(prices[i] - min > maxProfit){
maxProfit = prices[i] - min;
}
}
return maxProfit;
}
}