feat: leetcode 942

Author: ouduidui

Diff for: README.md

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

Diff for: assets/data/categories.json

@@ -2662,6 +2662,12 @@
         "path": "./problemset/patching-array/README.md",
         "difficulty": "困难"
       },
+      {
+        "id": "942",
+        "title": "增减字符串匹配",
+        "path": "./problemset/di-string-match/README.md",
+        "difficulty": "简单"
+      },
       {
         "id": "1663",
         "title": "具有给定数值的最小字符串",

Diff for: assets/data/topics.json

@@ -3219,6 +3219,16 @@
     "url": "https://leetcode-cn.com/problems/reorder-data-in-log-files/",
     "path": "./problemset/reorder-data-in-log-files/README.md"
   },
+  {
+    "id": "942",
+    "title": {
+      "cn": "增减字符串匹配",
+      "en": "di-string-match"
+    },
+    "difficulty": "简单",
+    "url": "https://leetcode.cn/problems/di-string-match/",
+    "path": "./problemset/di-string-match/README.md"
+  },
   {
     "id": "954",
     "title": {

Diff for: assets/docs/CATEGORIES.md

@@ -514,6 +514,7 @@
 | 122. [买卖股票的最佳时机 II](../../problemset/best-time-to-buy-and-sell-stock-2/README.md) | 中等 |
 | 300. [最长递增子序列](../../problemset/longest-increasing-subsequence/README.md) | 中等 |
 | 330. [按要求补齐数组](../../problemset/patching-array/README.md) | 困难 |
+| 942. [增减字符串匹配](../../problemset/di-string-match/README.md) | 简单 |
 | 1663. [具有给定数值的最小字符串](../../problemset/smallest-string-with-a-given-numeric-value/README.md) | 中等 |
 | 2038. [如果相邻两个颜色均相同则删除当前颜色](../../problemset/remove-colored-pieces-if-both-neighbors-are-the-same-color/README.md) | 中等 |
 

Diff for: assets/docs/TOPICS.md

@@ -644,6 +644,8 @@
 
 [937. 重新排列日志文件](../../problemset/reorder-data-in-log-files/README.md)
 
+[942. 增减字符串匹配](../../problemset/di-string-match/README.md)
+
 [954. 二倍数对数组](../../problemset/array-of-doubled-pairs/README.md)
 
 [969. 煎饼排序](../../problemset/pancake-sorting/README.md)

Diff for: problemset/di-string-match/README.md

@@ -0,0 +1,61 @@
+# 增减字符串匹配
+
+> 难度：简单
+>
+> https://leetcode.cn/problems/di-string-match/
+
+## 题目
+
+由范围 `[0,n]` 内所有整数组成的 `n + 1` 个整数的排列序列可以表示为长度为 `n` 的字符串 `s` ，其中:
+
+- 如果 `perm[i] < perm[i + 1]` ，那么 `s[i] == 'I'` 
+- 如果 `perm[i] > perm[i + 1]` ，那么 `s[i] == 'D'` 
+
+给定一个字符串 `s` ，重构排列 `perm` 并返回它。如果有多个有效排列`perm`，则返回其中 **任何一个** 。
+
+### 示例 
+
+#### 示例 1：
+
+```
+输入：s = "IDID"
+输出：[0,4,1,3,2]
+```
+
+#### 示例 2：
+
+```
+输入：s = "III"
+输出：[0,1,2,3]
+```
+
+#### 示例 3：
+
+```
+输入：s = "DDI"
+输出：[3,2,0,1]
+```
+
+## 解题
+
+```ts 
+/**
+ * 贪心算法
+ * @desc 时间复杂度 O(N)  空间复杂度 O(1)
+ * @param s
+ * @returns
+ */
+export function diStringMatch(s: string): number[] {
+  const len = s.length
+  const ans = new Array(len + 1).fill(0)
+  let low = 0
+  let high = len
+
+  for (let i = 0; i < len; i++)
+    ans[i] = s[i] === 'I' ? low++ : high--
+
+  ans[len] = low
+
+  return ans
+}
+```

Diff for: problemset/di-string-match/index.spec.ts

@@ -0,0 +1,16 @@
+import { describe, expect, it } from 'vitest'
+import { diStringMatch } from '.'
+
+describe('增减字符串匹配', () => {
+  testCase(diStringMatch)
+})
+
+function testCase(fn: (s: string) => number[]) {
+  it.each([
+    ['IDID', [0, 4, 1, 3, 2]],
+    ['III', [0, 1, 2, 3]],
+    ['DDI', [3, 2, 0, 1]],
+  ])('示例%#', (s, expected) => {
+    expect(fn(s)).toStrictEqual(expected)
+  })
+}

Diff for: problemset/di-string-match/index.ts

@@ -0,0 +1,19 @@
+/**
+ * 贪心算法
+ * @desc 时间复杂度 O(N)  空间复杂度 O(1)
+ * @param s
+ * @returns
+ */
+export function diStringMatch(s: string): number[] {
+  const len = s.length
+  const ans = new Array(len + 1).fill(0)
+  let low = 0
+  let high = len
+
+  for (let i = 0; i < len; i++)
+    ans[i] = s[i] === 'I' ? low++ : high--
+
+  ans[len] = low
+
+  return ans
+}