【剑指Offer】63. 股票的最大利润

class Solution {
    public int maxProfit(int[] prices) {
        if(prices.length == 0)
            return 0;
        int maxV = 0;
        int minV = prices[0];

        for(int i = 0; i < prices.length; i++) {
            minV = Math.min(minV, prices[i]);
            maxV = Math.max(prices[i] - minV, maxV);
        }
        return maxV;
    }
}