import java.util.*;
public class Solution {
/**
*
* @param prices int整型一维数组
* @return int整型
*/
public int maxProfit (int[] prices) {
// write code here
if (prices == null || prices.length < 2) {
return 0;
}
int min = Integer.MAX_VALUE;
int res = 0;
for (int i = 0; i < prices.length; i++) {
if (prices[i] < min) {
min = prices[i];
} else {
res = Math.max(res, prices[i] - min);
}
}
return res;
}
}

京公网安备 11010502036488号