[刷题]Best Time to Buy and Sell Stock III

[LintCode]Best Time to Buy and Sell Stock III

class Solution {    /**     * @param prices: Given an integer array     * @return: Maximum profit     */    public int maxProfit(int[] prices) {        // 2015-09-15        if (prices == null || prices.length <= 1) {            return 0;        }                // dp from left        int[] left = new int[prices.length];        int minPrice = Integer.MAX_VALUE;        left[0] = 0;        minPrice = prices[0];        for (int i = 1; i < prices.length; i++) {            minPrice = Math.min(minPrice, prices[i]);            left[i] = Math.max(0, prices[i] - minPrice);        }                // dp from right         int[] right = new int[prices.length];        int maxPrice = Integer.MIN_VALUE;        right[prices.length - 1] = 0;        maxPrice = prices[prices.length - 1];        for (int i = prices.length - 2; i >= 0; i--) {            maxPrice = Math.max(maxPrice, prices[i]);            right[i] = Math.max(right[i + 1], maxPrice - prices[i]);        }                int rst = 0;        for (int i = 0; i < prices.length; i++) {            rst = Math.max(rst, left[i] + right[i]);        }        return rst;    }};