✅ [1004] sliding window WOOHOOO

Author: enkr1

1004/my_solution.js

@@ -0,0 +1,74 @@
+/**
+ * @param {number[]} nums
+ * @param {number} k
+ * @return {number}
+ */
+var longestOnes = function (nums, k) {
+  let max = 0, tmpMax = 0, tmpK = k, acc = [], zeroIdxes = [], tmpSum = 0, l = 0, r = 0
+
+  // for (let i = 0; i < nums.length; i++) {
+  //   if (0 === nums[i]) {
+  //     console.log(`i: ${i}, nums[i]: ${nums[i]}`)
+  //     zeroIdxes.push(i)
+  //   }
+  //   tmpSum += nums[i]
+  //   acc[i] = tmpSum
+  // }
+
+  while (r < nums.length) {
+    tmpMax++;
+
+    console.log(`l: ${l}, r: ${r}, tmpK: ${tmpK}, tmpMax: ${tmpMax}`)
+    if (nums[r] === 0) {
+      tmpK--;
+
+      if (tmpK < 0) {
+        let idx = l
+
+        while (tmpK < 0) {
+          console.log(`-> tmpK:${tmpK}, nums[idx]: ${nums[idx]}`)
+
+          if (nums[idx] === 0) {
+            l = idx + 1;
+            tmpK++;
+            break;
+          }
+
+          idx++;
+        }
+
+        console.log(`--> tmpMax:${tmpMax}, tmpK: ${tmpK}`)
+        tmpMax = r - l + 1
+        console.log(`---> tmpMax:${tmpMax}, tmpK: ${tmpK}`)
+      }
+      // else {
+      //   // meet 0 and has credit to deduct
+      //   if (tmpK > 0) tmpK--;
+      // }
+    }
+
+    max = Math.max(max, tmpMax)
+
+    r++;
+  }
+
+  // console.log(zeroIdxes)
+  // console.log(acc)
+  // console.log(zeroIdxes.length - k - 1)
+
+  // let left = acc[acc.length - 1] - acc[zeroIdxes[zeroIdxes.length - k - 1]]
+  // console.log("left")
+  // console.log(left)
+  console.log("max")
+  console.log(max)
+
+  return max;
+};
+
+let x =
+  // longestOnes([1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 0], 2) // 6
+  longestOnes([0, 1, 0, 1, 1, 1, 1, 0, 0, 1, 1], 2) // 6
+// longestOnes([0, 0, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1], 3) // 10
+
+console.log("Res")
+console.log(x)

1004/solution.js

@@ -0,0 +1,36 @@
+/**
+ * @param {number[]} nums
+ * @param {number} k
+ * @return {number}
+ */
+var longestOnes = function (nums, k) {
+  let max = 0, tmpMax = 0, l = 0, r = 0
+
+  while (r < nums.length) {
+    tmpMax++;
+
+    if (nums[r] === 0) {
+      k--;
+
+      if (k < 0) {
+
+        while (k < 0) {
+          if (nums[l] === 0) {
+            l++; // the next one
+            k++;
+            break;
+          }
+
+          l++;
+        }
+
+        tmpMax = r - l + 1 // the new tmpMax will be r - l + 1 that is the size of the window
+      }
+    }
+
+    max = Math.max(max, tmpMax)
+    r++;
+  }
+
+  return max;
+};

README.md

@@ -96,6 +96,7 @@
 - [832. Flipping an Image](./832/)
 - [876. Middle of the Linked List](./876/)
 - [997. Find the Town Judge](./997/)
+- [1004. Max Consecutive Ones III](./1004/)
 - [1027. Longest Arithmetic Subsequence](./1027/)
 - [1071. Greatest Common Divisor of Strings](./1071/)
 - [1161. Maximum Level Sum of a Binary Tree](./1161/)
@@ -164,7 +165,7 @@ Batch create:
 NOTE: JS IS HERE
 -->
 ```ssh
-chapter=1456 && mkdir ./$chapter && touch ./$chapter/my_solution.js && touch ./$chapter/solution.js && alias x="node ./$chapter/my_solution.js"
+chapter=1004 && mkdir ./$chapter && touch ./$chapter/my_solution.js && touch ./$chapter/solution.js && alias x="node ./$chapter/my_solution.js"
 ```
 > then you can use `x` for quick debug.