Update 2025-maximum-number-of-ways-to-partition-an-array.js

Author: everthis

2025-maximum-number-of-ways-to-partition-an-array.js

@@ -1,3 +1,45 @@
+/**
+ * @param {number[]} nums
+ * @param {number} k
+ * @return {number}
+ */
+const waysToPartition = function (nums, k) {
+  const n = nums.length, pre = Array(n).fill(0), suf = Array(n).fill(0)
+  pre[0] = nums[0], suf[n - 1] = nums[n - 1]
+  for(let i = 1; i < n; i++) {
+    pre[i] = pre[i - 1] + nums[i]
+    suf[n - 1 - i] = suf[n - i] + nums[n - 1 - i]
+  }
+  const sum = nums.reduce((ac, e) => ac + e, 0)
+  let res = 0
+  for(let i = 0; i < n - 1; i++) {
+    if(pre[i] === suf[i + 1]) res++
+  }
+  const cnt = new Map()
+  const arr = Array(n).fill(0)
+  for(let i = 0; i < n; i++) {
+    const newSum = sum - nums[i] + k
+    if(newSum % 2 === 0) arr[i] += (cnt.get(newSum / 2) || 0)
+    cnt.set(pre[i], (cnt.get(pre[i]) || 0) + 1)
+  }
+  cnt.clear()
+  for(let i = n - 1; i >= 0; i--) {
+    const newSum = sum - nums[i] + k
+    if(newSum % 2 === 0) arr[i] += (cnt.get(newSum / 2) || 0)
+    cnt.set(suf[i], (cnt.get(suf[i]) || 0) + 1)
+  }
+  
+  for(let e of arr) {
+    if(e > res) res = e
+  }
+  
+  return res
+}
+
+
+// another
+
+
 /**
  * @param {number[]} nums
  * @param {number} k