feat: leetcode 1441

Author: ouduidui

README.md

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

@@ -2495,6 +2495,12 @@
         "path": "./problemset/maximum-score-after-splitting-a-string/README.md",
         "difficulty": "简单"
       },
+      {
+        "id": "1441",
+        "title": "用栈操作构建数组",
+        "path": "./problemset/build-an-array-with-stack-operations/README.md",
+        "difficulty": "中等"
+      },
       {
         "id": "1464",
         "title": "数组中的两元素的最大乘积",

assets/data/topics.json

@@ -4559,6 +4559,16 @@
     "url": "https://leetcode.cn/problems/maximum-score-after-splitting-a-string/",
     "path": "./problemset/maximum-score-after-splitting-a-string/README.md"
   },
+  {
+    "id": "1441",
+    "title": {
+      "cn": "用栈操作构建数组",
+      "en": "build-an-array-with-stack-operations"
+    },
+    "difficulty": "中等",
+    "url": "https://leetcode.cn/problems/build-an-array-with-stack-operations/",
+    "path": "./problemset/build-an-array-with-stack-operations/README.md"
+  },
   {
     "id": "1447",
     "title": {

assets/docs/CATEGORIES.md

@@ -457,6 +457,7 @@
 | 1342. [将数字变成 0 的操作次数](../../problemset/number-of-steps-to-reduce-a-number-to-zero/README.md) | 简单 |
 | 1374. [生成每种字符都是奇数个的字符串](../../problemset/generate-a-string-with-characters-that-have-odd-counts/README.md) | 简单 |
 | 1422. [分割字符串的最大得分](../../problemset/maximum-score-after-splitting-a-string/README.md) | 简单 |
+| 1441. [用栈操作构建数组](../../problemset/build-an-array-with-stack-operations/README.md) | 中等 |
 | 1464. [数组中的两元素的最大乘积](../../problemset/maximum-product-of-two-elements-in-an-array/README.md) | 简单 |
 | 1470. [重新排序数组](../../problemset/shuffle-the-array/README.md) | 简单 |
 | 1582. [二进制矩阵中的特殊位置](../../problemset/special-positions-in-a-binary-matrix/README.md) | 简单 |

assets/docs/TOPICS.md

@@ -912,6 +912,8 @@
 
 [1422. 分割字符串的最大得分](../../problemset/maximum-score-after-splitting-a-string/README.md)
 
+[1441. 用栈操作构建数组](../../problemset/build-an-array-with-stack-operations/README.md)
+
 [1447. 最简分数](../../problemset/simplified-fractions/README.md)
 
 [1450. 在既定时间做作业的学生人数](../../problemset/number-of-students-doing-homework-at-a-given-time/README.md)

problemset/build-an-array-with-stack-operations/README.md

@@ -0,0 +1,72 @@
+# 用栈操作构建数组
+
+> 难度：中等
+>
+> https://leetcode.cn/problems/build-an-array-with-stack-operations/
+
+## 题目
+
+给你一个数组 `target` 和一个整数 `n`。每次迭代，需要从  `list = { 1 , 2 , 3 ..., n }` 中依次读取一个数字。
+
+请使用下述操作来构建目标数组 `target` ：
+
+- `"Push"`：从 `list` 中读取一个新元素， 并将其推入数组中。
+- `"Pop"`：删除数组中的最后一个元素。
+- 如果目标数组构建完成，就停止读取更多元素。
+
+题目数据保证目标数组严格递增，并且只包含 `1` 到 `n` 之间的数字。
+
+请返回构建目标数组所用的操作序列。如果存在多个可行方案，返回任一即可。
+
+### 示例
+
+#### 示例 1：
+
+```
+输入：target = [1,3], n = 3
+输出：["Push","Push","Pop","Push"]
+解释： 
+读取 1 并自动推入数组 -> [1]
+读取 2 并自动推入数组，然后删除它 -> [1]
+读取 3 并自动推入数组 -> [1,3]
+```
+
+#### 示例 2：
+
+```
+输入：target = [1,2,3], n = 3
+输出：["Push","Push","Push"]
+```
+
+#### 示例 3：
+
+```
+输入：target = [1,2], n = 4
+输出：["Push","Push"]
+解释：只需要读取前 2 个数字就可以停止。
+```
+
+## 解题
+
+```ts 
+/**
+ * 模拟
+ * @desc 时间复杂度 O(N)  空间复杂度 O(1)
+ * @param target
+ * @param n
+ * @returns
+ */
+export function buildArray(target: number[], n: number): string[] {
+  const res = []
+  let prev = 0
+  for (const number of target) {
+    for (let i = 0; i < number - prev - 1; i++) {
+      res.push('Push')
+      res.push('Pop')
+    }
+    res.push('Push')
+    prev = number
+  }
+  return res
+}
+```

problemset/build-an-array-with-stack-operations/index.spec.ts

@@ -0,0 +1,22 @@
+import { describe, expect, it } from 'vitest'
+import { buildArray } from '.'
+
+describe('用栈操作构建数组', () => {
+  testCase(buildArray)
+})
+
+function testCase(fn: typeof buildArray) {
+  it.each([
+    [
+      [1, 3], 3, ['Push', 'Push', 'Pop', 'Push'],
+    ],
+    [
+      [1, 2, 3], 3, ['Push', 'Push', 'Push'],
+    ],
+    [
+      [1, 2], 4, ['Push', 'Push'],
+    ],
+  ])('示例%#', (target, n, expected) => {
+    expect(fn(target, n)).toStrictEqual(expected)
+  })
+}

problemset/build-an-array-with-stack-operations/index.ts

@@ -0,0 +1,21 @@
+/* eslint-disable @typescript-eslint/no-unused-vars */
+/**
+ * 模拟
+ * @desc 时间复杂度 O(N)  空间复杂度 O(1)
+ * @param target
+ * @param n
+ * @returns
+ */
+export function buildArray(target: number[], n: number): string[] {
+  const res = []
+  let prev = 0
+  for (const number of target) {
+    for (let i = 0; i < number - prev - 1; i++) {
+      res.push('Push')
+      res.push('Pop')
+    }
+    res.push('Push')
+    prev = number
+  }
+  return res
+}