1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18
| class Solution { public int maxProfit(int k, int[] prices) { int n = prices.length; int[][] dp = new int[n][2 * k + 1]; for (int i = 1; i <= k; i++) { dp[0][2 * i - 1] = -prices[0]; }
for (int i = 1; i < n; i++) { for (int j = 1; j < 2 * k + 1; j++) { dp[i][j] = Math.max(dp[i - 1][j], dp[i - 1][j - 1] + (((j & 1) == 0 ? 1 : -1) * prices[i])); } }
return dp[n - 1][2 * k]; } }
|
References
188. Best Time to Buy and Sell Stock IV