[leetcode] 121. Best Time to Buy and Sell Stock 解题报告

动态规划，注意处理当前最大值小于0的情况

public int maxProfit(int[] prices) {
        if (prices == null || prices.length <= 1) return 0;
        int curMax = 0,result = 0;
        for (int i = 1; i < prices.length; i++) {
            curMax = Math.max(0, curMax + prices[i] - prices[i-1]);
            result = Math.max(curMax,result);
        }
        return result;
    }