[leetcode] problem 188 – best time to buy and sell stock iv

public int (int k, int[] prices) {
    int n = prices.length;

    if (n == 0)
        return 0;

    if (k >= n)
        return maxProfit(prices);

    int[] T = new int[n];
    int[] prev = new int[n];

    for (int j = 1; j <= k; j++) {
        int maxDiff = -prices[0];

        for (int i = 1; i < n; i++) {
            T[i] = Math.max(T[i - 1], prices[i] + maxDiff);
            maxDiff = Math.max(maxDiff, prev[i] - prices[i]);
            prev[i] = T[i];
        }
    }

    return T[n - 1];
}

private int (int[] prices) {
    int result = 0;

    for (int i = 1; i < prices.length; i++) {
        if (prices[i] > prices[i - 1])
            result += prices[i] - prices[i - 1];
    }

    return result;
}