https://leetcode.cn/problems/cells-with-odd-values-in-a-matrix/

Author: masx200

README.md

@@ -890,6 +890,8 @@ https://leetcode.cn/problems/replace-words/
 
 https://leetcode.cn/problems/count-servers-that-communicate/
 
+https://leetcode.cn/problems/cells-with-odd-values-in-a-matrix/
+
 #### 安装教程
 
 1. 安装`deno`

calculator-lcci/test.ts

@@ -1,6 +1,6 @@
 import { assertEquals } from "../deps.ts";
 import calculate from "./index.ts";
-Deno.test("testcase-calculator", () => {
+Deno.test("calculator-lcci", () => {
     assertEquals(calculate("3+2*2"), 7);
     assertEquals(calculate("3/2"), 1);
     assertEquals(calculate(" 3+5 / 2 "), 5);

cells-with-odd-values-in-a-matrix/binary_count_one_bigint.ts

@@ -0,0 +1,10 @@
+export function binary_count_one_bigint(n: bigint) {
+    let ans = 0n;
+    while (n !== 0n) {
+        if (n % 2n) {
+            ans++;
+        }
+        n >>= 1n;
+    }
+    return ans;
+}

cells-with-odd-values-in-a-matrix/index.ts

@@ -0,0 +1,15 @@
+import { binary_count_one_bigint } from "./binary_count_one_bigint.ts";
+
+function oddCells(m: number, n: number, indices: number[][]): number {
+    let row = 0n;
+    let col = 0n;
+    for (const [r, c] of indices) {
+        row ^= 1n << BigInt(r);
+        col ^= 1n << BigInt(c);
+    }
+
+    const x = Number(binary_count_one_bigint(row));
+    const y = Number(binary_count_one_bigint(col));
+    return x * n + y * m - 2 * x * y;
+}
+export default oddCells;

cells-with-odd-values-in-a-matrix/test.ts

@@ -0,0 +1,45 @@
+import { assertEquals } from "../deps.ts";
+import oddCells from "./index.ts";
+
+Deno.test("cells-with-odd-values-in-a-matrix", () => {
+    assertEquals(
+        6,
+        oddCells(2, 3, [
+            [0, 1],
+            [1, 1],
+        ]),
+    );
+    assertEquals(
+        0,
+        oddCells(2, 2, [
+            [1, 1],
+            [0, 0],
+        ]),
+    );
+    assertEquals(
+        659,
+        oddCells(41, 38, [
+            [38, 33],
+            [37, 24],
+            [33, 6],
+            [15, 0],
+            [13, 22],
+            [1, 13],
+            [12, 8],
+            [20, 4],
+            [30, 9],
+            [21, 0],
+            [35, 29],
+            [21, 20],
+            [36, 24],
+            [40, 16],
+            [3, 24],
+            [32, 6],
+            [19, 28],
+            [1, 13],
+            [30, 19],
+            [28, 20],
+            [28, 2],
+        ]),
+    );
+});

mod.ts

@@ -63,6 +63,7 @@ import { inorder } from "./binary-tree-inorder-traversal/inorder.ts";
 import { buildBST } from "./convert-sorted-list-to-binary-search-tree/buildBST.ts";
 import { traversal_bst_range } from "./tweet-counts-per-frequency/traversal_bst_range.ts";
 import { left_rotate } from "./spiral-matrix/left_rotate.ts";
+import { binary_count_one_bigint } from "./cells-with-odd-values-in-a-matrix/binary_count_one_bigint.ts";
 export {
     left_rotate,
     TrieNode,
@@ -103,6 +104,6 @@ export { abs_bigint, searchSegmentChildren, searchSegmentLeaf };
 export { counter };
 export { Node as MultilevelDoublyLinkedListNode } from "./flatten-a-multilevel-doubly-linked-list/Node.ts";
 export { MyLinkedList };
-export { level };
+export { binary_count_one_bigint, level };
 export { buildBST, inorder };
 export { traversal_bst_range };