This approach uses dynamic programming with a one-dimensional array to find the solution. We use an array dp where dp[i] stores the maximum sum we can get for the array arr from the 0th index to the ith index. For each position, we try to partition the last k elements and update the dp array accordingly, keeping track of the maximum value observed in those elements to account for possible transformations.
Time Complexity: O(n * k) since for each index, we consider up to k previous elements.
Space Complexity: O(n) for the dp array.
1function maxSumAfterPartitioning(arr, k) {
2 const n = arr.length;
3 const dp = Array(n + 1).fill(0);
4 for (let i = 1; i <= n; i++) {
5 let maxElem = 0, maxSum = 0;
6 for (let j = 1; j <= k && i-j >= 0; j++) {
7 maxElem = Math.max(maxElem, arr[i-j]);
8 maxSum = Math.max(maxSum, dp[i-j] + maxElem * j);
9 }
10 dp[i] = maxSum;
11 }
12 return dp[n];
13}
14
15const arr = [1, 15, 7, 9, 2, 5, 10];
16const k = 3;
17console.log(maxSumAfterPartitioning(arr, k));This JavaScript function applies dynamic programming through an array dp to capture maximum sums achievable via partitioning. Like previous solutions, for each index, it evaluates maximum partition sums through up to k potential previous elements, storing the largest results attained.
In this approach, a recursive function is used to solve the problem, combined with memoization to store previously computed results. The idea is to break the problem into subproblems by recursively partitioning the array from each position and recalculating sums. Alongside recursion, memoization saves time by avoiding recomputation of results for elements already processed.
Time Complexity: O(n * k), due to exponential recursive divisions curtailed by memoization.
Space Complexity: O(n) for memoization storage.
1import java.util.Arrays;
2
3class Solution {
4 private int helper(int[] arr, int n, int k, int[] memo, int i) {
5 if (i >= n) return 0;
6 if (memo[i] != -1) return memo[i];
7 int maxElem = 0, maxSum = 0;
8 for (int j = i; j < i + k && j < n; j++) {
9 maxElem = Math.max(maxElem, arr[j]);
10 maxSum = Math.max(maxSum, maxElem * (j-i+1) + helper(arr, n, k, memo, j+1));
11 }
12 return memo[i] = maxSum;
13 }
14
15 public int maxSumAfterPartitioning(int[] arr, int k) {
16 int n = arr.length;
17 int[] memo = new int[n];
18 Arrays.fill(memo, -1);
19 return helper(arr, n, k, memo, 0);
20 }
21
22 public static void main(String[] args) {
23 Solution sol = new Solution();
24 int[] arr = {1, 15, 7, 9, 2, 5, 10};
25 int k = 3;
26 System.out.println(sol.maxSumAfterPartitioning(arr, k));
27 }
28}Using a recursive approach embedded with memoization, the Java solution efficiently partitions arrays by caching pre-calculated partial results. The recursive process loops through allowable partitions and computes new maximum sums which are stored and reused when possible.