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

import java.util.*;


public class Solution {
    /**
     * 
     * @param prices int整型一维数组 
     * @return int整型
     */
    public int maxProfit (int[] prices) {
        if (prices.length <= 1) {
            return 0;
        }
        int maxProfit = 0;
        int lowPrice = 10001;
        for (int i = 0; i < prices.length; i++) {
            if (lowPrice > prices[i]) {
                lowPrice = prices[i];
            }
            if (prices[i] - lowPrice > maxProfit) {
                maxProfit = prices[i] - lowPrice;
            }
        }
        return maxProfit;
    }
}