Test123

public int maxPrifit(int[] prices) {
    int n = prices.length;
    int ans = 0;
    int[][][] dp = new int[2][3][2];
    int INF = Integer.MIN_VALUE/2;
    for (int i = 0; i < 2; i++) {
        dp[i][0][0] = INF;
    }
    dp[0][1][0] = -prices[0];
    dp[0][1][1] = INF;
    dp[0][2][0] = INF;
    dp[0][2][1] = INF;
    int base = 0;
    for (int i = 1; i < n; i++) {
        base ^= 1;
        for (int j = 1; j < 3; j++) {
            dp[base][j][0] = Math.max(dp[base ^ 1][j - 1][1] - prices[i],dp[base ^ 1][j][0]);
            dp[base][j][1] = Math.max(dp[base ^ 1][j][0] + prices[i], dp[base ^ 1][j][1]);
        }
        ans = Math.max(dp[base][2][1], ans);
        ans = Math.max(dp[base][1][1], ans);
    }
    return ans;
}