feat: leetcode 1089

Author: ouduidui

README.md

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

@@ -2003,6 +2003,12 @@
         "path": "./problemset/pancake-sorting/README.md",
         "difficulty": "中等"
       },
+      {
+        "id": "1089",
+        "title": "复写零",
+        "path": "./problemset/duplicate-zeros/README.md",
+        "difficulty": "简单"
+      },
       {
         "id": "1342",
         "title": "将数字变成 0 的操作次数",

assets/data/topics.json

@@ -3649,6 +3649,16 @@
     "url": "https://leetcode.cn/problems/height-checker/",
     "path": "./problemset/height-checker/README.md"
   },
+  {
+    "id": "1089",
+    "title": {
+      "cn": "复写零",
+      "en": "duplicate-zeros"
+    },
+    "difficulty": "简单",
+    "url": "https://leetcode.cn/problems/duplicate-zeros/",
+    "path": "./problemset/duplicate-zeros/README.md"
+  },
   {
     "id": "1189",
     "title": {

assets/docs/CATEGORIES.md

@@ -375,6 +375,7 @@
 | 944. [删列造序](../../problemset/delete-columns-to-make-sorted/README.md) | 简单 |
 | 953. [验证外星语词典](../../problemset/verifying-an-alien-dictionary/README.md) | 简单 |
 | 969. [煎饼排序](../../problemset/pancake-sorting/README.md) | 中等 |
+| 1089. [复写零](../../problemset/duplicate-zeros/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

@@ -730,6 +730,8 @@
 
 [1051. 高度检查器](../../problemset/height-checker/README.md)
 
+[1089. 复写零](../../problemset/duplicate-zeros/README.md)
+
 [1189. “气球” 的最大数量](../../problemset/maximum-number-of-balloons/README.md)
 
 [1305. 两颗二叉搜索树中的所有元素](../../problemset/all-elements-in-two-binary-search-trees/README.md)

problemset/duplicate-zeros/README.md

@@ -0,0 +1,53 @@
+# 复写零
+
+> 难度：简单
+>
+> https://leetcode.cn/problems/duplicate-zeros/
+
+## 题目
+
+给你一个长度固定的整数数组 `arr`，请你将该数组中出现的每个零都复写一遍，并将其余的元素向右平移。
+
+注意：请不要在超过该数组长度的位置写入元素。
+
+要求：请对输入的数组 **就地** 进行上述修改，不要从函数返回任何东西。
+
+### 示例
+
+#### 示例 1：
+
+```
+输入：[1,0,2,3,0,4,5,0]
+输出：null
+解释：调用函数后，输入的数组将被修改为：[1,0,0,2,3,0,0,4]
+```
+
+#### 示例 2：
+
+```
+输入：[1,2,3]
+输出：null
+解释：调用函数后，输入的数组将被修改为：[1,2,3]
+```
+
+## 解题
+
+```ts 
+/**
+ * 遍历
+ * @desc 时间复杂度 O(N)  空间复杂度 O(1)
+ * @param arr
+ */
+export function duplicateZeros(arr: number[]): void {
+  const len = arr.length
+  let i = 0
+  while (i < len) {
+    if (arr[i] === 0) {
+      arr.pop()
+      arr.splice(i, 0, 0)
+      i++
+    }
+    i++
+  }
+}
+```

problemset/duplicate-zeros/index.spec.ts

@@ -0,0 +1,22 @@
+import { describe, expect, it } from 'vitest'
+import { duplicateZeros } from '.'
+
+describe('复写零', () => {
+  testCase(duplicateZeros)
+})
+
+function testCase(fn: (arr: number[]) => void) {
+  it.each([
+    [
+      [1, 0, 2, 3, 0, 4, 5, 0],
+      [1, 0, 0, 2, 3, 0, 0, 4],
+    ],
+    [
+      [1, 2, 3],
+      [1, 2, 3],
+    ],
+  ])('示例%#', (arr, expected) => {
+    fn(arr)
+    expect(arr).toStrictEqual(expected)
+  })
+}

problemset/duplicate-zeros/index.ts

@@ -0,0 +1,17 @@
+/**
+ * 遍历
+ * @desc 时间复杂度 O(N)  空间复杂度 O(1)
+ * @param arr
+ */
+export function duplicateZeros(arr: number[]): void {
+  const len = arr.length
+  let i = 0
+  while (i < len) {
+    if (arr[i] === 0) {
+      arr.pop()
+      arr.splice(i, 0, 0)
+      i++
+    }
+    i++
+  }
+}