力扣-12.20-309

分析：

class Solution {
    public int maxProfit(int[] prices) {
        if(prices == null || prices.length == 0) {
			return 0;
		}
		int len = prices.length;
		int[][] dp = new int[len + 1][3];
		dp[1][0] = -prices[0];
		dp[1][1] = 0;
		dp[1][2] = 0;
		for(int i = 2; i <= len; i++) {
			dp[i][0] = Math.max(dp[i - 1][0], dp[i - 1][2] - prices[i - 1]);
			dp[i][1] = dp[i - 1][0] + prices[i - 1];
			dp[i][2] = Math.max(dp[i - 1][1], dp[i - 1][2]);
		}
		return Math.max(dp[len][1], dp[len][2]);
    }
}