feat: leetcode 1812

Author: deweyou

README.md

@@ -2,7 +2,7 @@
 
 <p align="center">
 <!-- TOPICS COUNT START -->
-<img src="https://img.shields.io/badge/-进度:565-green" alt="进度:565">
+<img src="https://img.shields.io/badge/-进度:566-green" alt="进度:566">
 <!-- 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

@@ -1407,6 +1407,12 @@
         "path": "./problemset/find-center-of-star-graph/README.md",
         "difficulty": "简单"
       },
+      {
+        "id": "1812",
+        "title": "判断国际象棋棋盘中一个格子的颜色",
+        "path": "./problemset/determine-color-of-a-chessboard-square/README.md",
+        "difficulty": "简单"
+      },
       {
         "id": "1823",
         "title": "找出游戏的获胜者",

assets/data/topics.json

@@ -5299,6 +5299,16 @@
     "url": "https://leetcode.cn/problems/number-of-different-integers-in-a-string/",
     "path": "./problemset/number-of-different-integers-in-a-string/README.md"
   },
+  {
+    "id": "1812",
+    "title": {
+      "cn": "判断国际象棋棋盘中一个格子的颜色",
+      "en": "determine-color-of-a-chessboard-square"
+    },
+    "difficulty": "简单",
+    "url": "https://leetcode.cn/problems/determine-color-of-a-chessboard-square/",
+    "path": "./problemset/determine-color-of-a-chessboard-square/README.md"
+  },
   {
     "id": "1822",
     "title": {
@@ -5649,4 +5659,4 @@
     "url": "https://leetcode.cn/problems/zero-matrix-lcci/",
     "path": "./problemset/zero-matrix-lcci/README.md"
   }
-]
+]

assets/docs/CATEGORIES.md

@@ -259,6 +259,7 @@
 | 1704. [判断字符串的两半是否相似](../../problemset/determine-if-string-halves-are-alike/README.md) | 简单 |
 | 1784. [检查二进制字符串字段](../../problemset/check-if-binary-string-has-at-most-one-segment-of-ones/README.md) | 简单 |
 | 1791. [找出星型图的中心节点](../../problemset/find-center-of-star-graph/README.md) | 简单 |
+| 1812. [判断国际象棋棋盘中一个格子的颜色](../../problemset/determine-color-of-a-chessboard-square/README.md) | 简单 |
 | 1823. [找出游戏的获胜者](../../problemset/find-the-winner-of-the-circular-game/README.md) | 中等 |
 
 ## 自动机

assets/docs/TOPICS.md

@@ -1060,6 +1060,8 @@
 
 [1805. 字符串中不同整数的数目](../../problemset/number-of-different-integers-in-a-string/README.md)
 
+[1812. 判断国际象棋棋盘中一个格子的颜色](../../problemset/determine-color-of-a-chessboard-square/README.md)
+
 [1822. 数组元素积的符号](../../problemset/sign-of-the-product-of-an-array/README.md)
 
 [1823. 找出游戏的获胜者](../../problemset/find-the-winner-of-the-circular-game/README.md)

problemset/description/README.md

@@ -37,19 +37,19 @@
 /**
  * 数学
  * @desc 时间复杂度 O(NlogN) 空间复杂度 O(logN)
- * @param nums 
- * @returns 
+ * @param nums
+ * @returns
  */
 export function sumSubseqWidths(nums: number[]): number {
-  const MOD = 1000000007;
-    nums.sort((a, b) => a - b);
-    let res = 0;
-    let x = nums[0], y = 2;
-    for (let j = 1; j < nums.length; j++) {
-        res = (res + nums[j] * (y - 1) - x) % MOD;
-        x = (x * 2 + nums[j]) % MOD;
-        y = y * 2 % MOD;
-    }
-    return (res + MOD) % MOD;
-};
+  const MOD = 1000000007
+  nums.sort((a, b) => a - b)
+  let res = 0
+  let x = nums[0]; let y = 2
+  for (let j = 1; j < nums.length; j++) {
+    res = (res + nums[j] * (y - 1) - x) % MOD
+    x = (x * 2 + nums[j]) % MOD
+    y = y * 2 % MOD
+  }
+  return (res + MOD) % MOD
+}
 ```

problemset/determine-color-of-a-chessboard-square/README.md

@@ -0,0 +1,54 @@
+# 判断国际象棋棋盘中一个格子的颜色
+
+> 难度：简单
+>
+> https://leetcode.cn/problems/determine-color-of-a-chessboard-square/
+
+## 题目
+
+给你一个坐标 `coordinates` ，它是一个字符串，表示国际象棋棋盘中一个格子的坐标。下图是国际象棋棋盘示意图。
+
+![image](https://user-images.githubusercontent.com/54696834/206342937-baff0119-7739-4588-ae89-dcbf6d22cebf.png)
+
+如果所给格子的颜色是白色，请你返回 `true`，如果是黑色，请返回 `false` 。
+
+给定坐标一定代表国际象棋棋盘上一个存在的格子。坐标第一个字符是字母，第二个字符是数字。
+
+### 示例
+
+#### 示例 1：
+
+```
+输入：coordinates = "a1"
+输出：false
+解释：如上图棋盘所示，"a1" 坐标的格子是黑色的，所以返回 false 。
+```
+
+#### 示例 2：
+
+```
+输入：coordinates = "h3"
+输出：true
+解释：如上图棋盘所示，"h3" 坐标的格子是白色的，所以返回 true 。
+```
+
+#### 示例 3：
+
+```
+输入：coordinates = "c7"
+输出：false
+```
+
+## 解题
+
+```ts 
+/**
+ * 数学
+ * @desc 时间复杂度 O(1) 空间复杂度 O(1)
+ * @param coordinates
+ * @returns
+ */
+export function squareIsWhite(coordinates: string): boolean {
+  return ((coordinates[0].charCodeAt(0) - 'a'.charCodeAt(0) + 1) + (coordinates[1].charCodeAt(0) - '0'.charCodeAt(0))) % 2 === 1
+}
+```

problemset/determine-color-of-a-chessboard-square/index.spec.ts

@@ -0,0 +1,16 @@
+import { describe, expect, it } from 'vitest'
+import { squareIsWhite } from '.'
+
+describe('判断国际象棋棋盘中一个格子的颜色', () => {
+  testCase(squareIsWhite)
+})
+
+function testCase(fn: (coordinates: string) => boolean) {
+  it.each([
+    ['a1', false],
+    ['h3', true],
+    ['c7', false],
+  ])('示例%#', (corrdinates, expected) => {
+    expect(fn(corrdinates)).toBe(expected)
+  })
+}

problemset/determine-color-of-a-chessboard-square/index.ts

@@ -0,0 +1,9 @@
+/**
+ * 数学
+ * @desc 时间复杂度 O(1) 空间复杂度 O(1)
+ * @param coordinates
+ * @returns
+ */
+export function squareIsWhite(coordinates: string): boolean {
+  return ((coordinates[0].charCodeAt(0) - 'a'.charCodeAt(0) + 1) + (coordinates[1].charCodeAt(0) - '0'.charCodeAt(0))) % 2 === 1
+}

problemset/k-similar-strings/README.md

@@ -31,9 +31,9 @@
 ```ts 
 /**
  * 广度优先遍历
- * @param s1 
- * @param s2 
- * @returns 
+ * @param s1
+ * @param s2
+ * @returns
  */
 export function kSimilarity(s1: string, s2: string): number {
   const n = s1.length