题解 | #买卖股票的最好时机(一)#

import java.util.*;


public class Solution {
    /**
     * 
     * @param prices int整型一维数组 
     * @return int整型
     */
    public int maxProfit (int[] prices) {
        // write code here
        int N = prices.length;
        int min = prices[0];
        int maxVal = 0;
        for(int i = 1; i < N; i++) {
            maxVal = Math.max(maxVal, prices[i] - min);
            if(prices[i] < min) {
                min = prices[i];
            }
        }
        return maxVal;
    }
}