Add solution #1043

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,116 LeetCode solutions in JavaScript
+# 1,117 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -850,6 +850,7 @@
 1040|[Moving Stones Until Consecutive II](./solutions/1040-moving-stones-until-consecutive-ii.js)|Medium|
 1041|[Robot Bounded In Circle](./solutions/1041-robot-bounded-in-circle.js)|Medium|
 1042|[Flower Planting With No Adjacent](./solutions/1042-flower-planting-with-no-adjacent.js)|Medium|
+1043|[Partition Array for Maximum Sum](./solutions/1043-partition-array-for-maximum-sum.js)|Medium|
 1047|[Remove All Adjacent Duplicates In String](./solutions/1047-remove-all-adjacent-duplicates-in-string.js)|Easy|
 1051|[Height Checker](./solutions/1051-height-checker.js)|Easy|
 1071|[Greatest Common Divisor of Strings](./solutions/1071-greatest-common-divisor-of-strings.js)|Easy|

solutions/1043-partition-array-for-maximum-sum.js

@@ -0,0 +1,31 @@
+/**
+ * 1043. Partition Array for Maximum Sum
+ * https://leetcode.com/problems/partition-array-for-maximum-sum/
+ * Difficulty: Medium
+ *
+ * Given an integer array arr, partition the array into (contiguous) subarrays of length at most k.
+ * After partitioning, each subarray has their values changed to become the maximum value of that
+ * subarray.
+ *
+ * Return the largest sum of the given array after partitioning. Test cases are generated so that
+ * the answer fits in a 32-bit integer.
+ */
+
+/**
+ * @param {number[]} arr
+ * @param {number} k
+ * @return {number}
+ */
+var maxSumAfterPartitioning = function(arr, k) {
+  const dp = new Array(arr.length + 1).fill(0);
+
+  for (let i = 1; i <= arr.length; i++) {
+    let maxVal = 0;
+    for (let j = 1; j <= Math.min(k, i); j++) {
+      maxVal = Math.max(maxVal, arr[i - j]);
+      dp[i] = Math.max(dp[i], dp[i - j] + maxVal * j);
+    }
+  }
+
+  return dp[arr.length];
+};