No121.java

packageAlgorithm.leetcode.Array;

publicclassNo121 {
publicstaticvoidmain(String[] args) {
int[] a = { 7, 1, 5, 3, 6, 4 };
intb = maxProfit(a);
System.out.println(b);
 }

publicstaticintmaxProfit(int[] prices) {
intlen = prices.length;
if (len == 0) {
return0;
 }
intmid = 0;
intbegin = prices[0];
for (inti = 1; i < len; i++) {
if (prices[i] < begin) {
begin = prices[i];
 }
if (prices[i] > begin) {
mid = prices[i] - begin > mid ? prices[i] - begin : mid;
 }
 }
returnmid;
 }
}