feat: add 2nd ts solution to lc problem: No.0995

doocs · Jun 24, 2024 · 6b20569 · 6b20569
1 parent 6c44148
commit 6b20569
Show file tree

Hide file tree

Showing 3 changed files with 81 additions and 0 deletions.
diff --git a/solution/0900-0999/0995.Minimum Number of K Consecutive Bit Flips/README.md b/solution/0900-0999/0995.Minimum Number of K Consecutive Bit Flips/README.md
@@ -234,4 +234,36 @@ impl Solution {
 
 <!-- solution:end -->
 
+<!-- solution:start -->
+
+### Solution 2
+
+<!-- tabs:start -->
+
+#### TypeScript
+
+```ts
+function minKBitFlips(nums: number[], k: number): number {
+    const n = nums.length;
+    let [ans, flipped] = [0, 0];
+
+    for (let i = 0; i < n; i++) {
+        if (nums[i - k] === -1) flipped--;
+        if (nums[i] === (flipped & 1)) {
+            flipped++;
+            ans++;
+            nums[i] = -1;
+
+            if (n - k < i) return -1;
+        }
+    }
+
+    return ans;
+}
+```
+
+<!-- tabs:end -->
+
+<!-- solution:end -->
+
 <!-- problem:end -->
diff --git a/solution/0900-0999/0995.Minimum Number of K Consecutive Bit Flips/README_EN.md b/solution/0900-0999/0995.Minimum Number of K Consecutive Bit Flips/README_EN.md
@@ -232,4 +232,36 @@ impl Solution {
 
 <!-- solution:end -->
 
+<!-- solution:start -->
+
+### Solution 2
+
+<!-- tabs:start -->
+
+#### TypeScript
+
+```ts
+function minKBitFlips(nums: number[], k: number): number {
+    const n = nums.length;
+    let [ans, flipped] = [0, 0];
+
+    for (let i = 0; i < n; i++) {
+        if (nums[i - k] === -1) flipped--;
+        if (nums[i] === (flipped & 1)) {
+            flipped++;
+            ans++;
+            nums[i] = -1;
+
+            if (n - k < i) return -1;
+        }
+    }
+
+    return ans;
+}
+```
+
+<!-- tabs:end -->
+
+<!-- solution:end -->
+
 <!-- problem:end -->
diff --git a/solution/0900-0999/0995.Minimum Number of K Consecutive Bit Flips/Solution2.ts b/solution/0900-0999/0995.Minimum Number of K Consecutive Bit Flips/Solution2.ts
@@ -0,0 +1,17 @@
+function minKBitFlips(nums: number[], k: number): number {
+    const n = nums.length;
+    let [ans, flipped] = [0, 0];
+
+    for (let i = 0; i < n; i++) {
+        if (nums[i - k] === -1) flipped--;
+        if (nums[i] === (flipped & 1)) {
+            flipped++;
+            ans++;
+            nums[i] = -1;
+
+            if (n - k < i) return -1;
+        }
+    }
+
+    return ans;
+}