feat: leetcode 1252

Author: deweyou

README.md

@@ -2,7 +2,7 @@
 
 <p align="center">
 <!-- TOPICS COUNT START -->
-<img src="https://img.shields.io/badge/-进度:428-green" alt="进度:428">
+<img src="https://img.shields.io/badge/-进度:429-green" alt="进度:429">
 <!-- TOPICS COUNT END -->
 <a href="./assets/docs/TOPICS.md"><img src="https://img.shields.io/badge/-题库目录-blue" alt="题库目录"></a>
 <a href="./assets/docs/CATEGORIES.md"><img src="https://img.shields.io/badge/-题库分类-red" alt="题库分类"></a>

assets/data/categories.json

@@ -2117,6 +2117,12 @@
         "path": "./problemset/defanging-an-ip-address/README.md",
         "difficulty": "简单"
       },
+      {
+        "id": "1252",
+        "title": "奇数值单元格的数目",
+        "path": "./problemset/cells-with-odd-values-in-a-matrix/README.md",
+        "difficulty": "简单"
+      },
       {
         "id": "1342",
         "title": "将数字变成 0 的操作次数",

assets/data/topics.json

@@ -3879,6 +3879,16 @@
     "url": "https://leetcode.cn/problems/minimum-cost-to-move-chips-to-the-same-position/",
     "path": "./problemset/minimum-cost-to-move-chips-to-the-same-position/README.md"
   },
+  {
+    "id": "1252",
+    "title": {
+      "cn": "奇数值单元格的数目",
+      "en": "cells-with-odd-values-in-a-matrix"
+    },
+    "difficulty": "简单",
+    "url": "https://leetcode.cn/problems/cells-with-odd-values-in-a-matrix/",
+    "path": "./problemset/cells-with-odd-values-in-a-matrix/README.md"
+  },
   {
     "id": "1305",
     "title": {

assets/docs/CATEGORIES.md

@@ -394,6 +394,7 @@
 | 969. [煎饼排序](../../problemset/pancake-sorting/README.md) | 中等 |
 | 1089. [复写零](../../problemset/duplicate-zeros/README.md) | 简单 |
 | 1108. [IP地址无效化](../../problemset/defanging-an-ip-address/README.md) | 简单 |
+| 1252. [奇数值单元格的数目](../../problemset/cells-with-odd-values-in-a-matrix/README.md) | 简单 |
 | 1342. [将数字变成 0 的操作次数](../../problemset/number-of-steps-to-reduce-a-number-to-zero/README.md) | 简单 |
 | 1606. [找到处理最多请求的服务器](../../problemset/find-servers-that-handled-most-number-of-requests/README.md) | 困难 |
 | 1672. [最富有客户的资产总量](../../problemset/richest-customer-wealth/README.md) | 简单 |

assets/docs/TOPICS.md

@@ -776,6 +776,8 @@
 
 [1217. 玩筹码](../../problemset/minimum-cost-to-move-chips-to-the-same-position/README.md)
 
+[1252. 奇数值单元格的数目](../../problemset/cells-with-odd-values-in-a-matrix/README.md)
+
 [1305. 两颗二叉搜索树中的所有元素](../../problemset/all-elements-in-two-binary-search-trees/README.md)
 
 [1342. 将数字变成 0 的操作次数](../../problemset/number-of-steps-to-reduce-a-number-to-zero/README.md)

problemset/cells-with-odd-values-in-a-matrix/README.md

@@ -0,0 +1,75 @@
+# 奇数值单元格的数目
+
+> 难度：简单
+>
+> https://leetcode.cn/problems/cells-with-odd-values-in-a-matrix/
+
+## 题目
+
+给你一个 `m x n` 的矩阵，最开始的时候，每个单元格中的值都是 `0`。
+
+另有一个二维索引数组 `indices`，`indices[i] = [ri, ci]` 指向矩阵中的某个位置，其中 `ri` 和 `ci` 分别表示指定的行和列（从 `0` 开始编号）。
+
+对 `indices[i]` 所指向的每个位置，应同时执行下述增量操作：
+
+- `ri` 行上的所有单元格，加 `1` 。
+- `ci` 列上的所有单元格，加 `1` 。
+
+给你 `m`、`n` 和 `indices` 。请你在执行完所有 `indices` 指定的增量操作后，返回矩阵中 **奇数值单元格** 的数目。
+
+### 示例
+
+#### 示例 1：
+
+![image](https://user-images.githubusercontent.com/54696834/178393373-68b458b2-f46a-4208-bc52-b96555eadb98.png)
+
+```
+输入：m = 2, n = 3, indices = [[0,1],[1,1]]
+输出：6
+解释：最开始的矩阵是 [[0,0,0],[0,0,0]]。
+第一次增量操作后得到 [[1,2,1],[0,1,0]]。
+最后的矩阵是 [[1,3,1],[1,3,1]]，里面有 6 个奇数。
+```
+
+#### 示例 2：
+
+![image](https://user-images.githubusercontent.com/54696834/178393381-68c8d779-68cf-4164-a043-bcd858a6bcba.png)
+
+```
+输入：m = 2, n = 2, indices = [[1,1],[0,0]]
+输出：0
+解释：最后的矩阵是 [[2,2],[2,2]]，里面没有奇数。
+```
+
+## 解题
+
+```ts 
+/**
+ * 模拟
+ * @desc 时间复杂度 O(q + m + n)  空间复杂度 O(m + n)
+ * @param m
+ * @param n
+ * @param indices
+ * @returns
+ */
+export function oddCells(m: number, n: number, indices: number[][]): number {
+  const rows = new Array(m).fill(0)
+  const cols = new Array(n).fill(0)
+
+  for (const [r, c] of indices) {
+    rows[r]++
+    cols[c]++
+  }
+
+  let oddx = 0
+  let oddy = 0
+
+  for (const row of rows)
+    if ((row & 1) !== 0) oddx++
+
+  for (const col of cols)
+    if ((col & 1) !== 0) oddy++
+
+  return oddx * (n - oddy) + (m - oddx) * oddy
+}
+```

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

@@ -0,0 +1,15 @@
+import { describe, expect, it } from 'vitest'
+import { oddCells } from '.'
+
+describe('奇数值单元格的数目', () => {
+  testCase(oddCells)
+})
+
+function testCase(fn: (m: number, n: number, indices: number[][]) => number) {
+  it.each([
+    [2, 3, [[0, 1], [1, 1]], 6],
+    [2, 2, [[1, 1], [0, 0]], 0],
+  ])('示例%#', (m, n, indices, expected) => {
+    expect(fn(m, n, indices)).toBe(expected)
+  })
+}

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

@@ -0,0 +1,28 @@
+/**
+ * 模拟
+ * @desc 时间复杂度 O(q + m + n)  空间复杂度 O(m + n)
+ * @param m
+ * @param n
+ * @param indices
+ * @returns
+ */
+export function oddCells(m: number, n: number, indices: number[][]): number {
+  const rows = new Array(m).fill(0)
+  const cols = new Array(n).fill(0)
+
+  for (const [r, c] of indices) {
+    rows[r]++
+    cols[c]++
+  }
+
+  let oddx = 0
+  let oddy = 0
+
+  for (const row of rows)
+    if ((row & 1) !== 0) oddx++
+
+  for (const col of cols)
+    if ((col & 1) !== 0) oddy++
+
+  return oddx * (n - oddy) + (m - oddx) * oddy
+}