feat: leetcode 1958

Author: deweyou

README.md

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

@@ -2411,6 +2411,12 @@
         "path": "./problemset/number-of-ways-to-reconstruct-a-tree/README.md",
         "difficulty": "困难"
       },
+      {
+        "id": "1958",
+        "title": "文件夹操作日志搜集器",
+        "path": "./problemset/crawler-log-folder/README.md",
+        "difficulty": "简单"
+      },
       {
         "id": "1961",
         "title": "检查字符串是否为数组前缀",

assets/data/topics.json

@@ -4619,6 +4619,16 @@
     "url": "https://leetcode-cn.com/problems/check-if-the-sentence-is-pangram/",
     "path": "./problemset/check-if-the-sentence-is-pangram/README.md"
   },
+  {
+    "id": "1958",
+    "title": {
+      "cn": "文件夹操作日志搜集器",
+      "en": "crawler-log-folder"
+    },
+    "difficulty": "简单",
+    "url": "https://leetcode.cn/problems/crawler-log-folder/",
+    "path": "./problemset/crawler-log-folder/README.md"
+  },
   {
     "id": "1961",
     "title": {

assets/docs/CATEGORIES.md

@@ -443,6 +443,7 @@
 | 1672. [最富有客户的资产总量](../../problemset/richest-customer-wealth/README.md) | 简单 |
 | 1706. [球会落何处](../../problemset/where-will-the-ball-fall/README.md) | 中等 |
 | 1719. [重构一棵树的方案数](../../problemset/number-of-ways-to-reconstruct-a-tree/README.md) | 困难 |
+| 1958. [文件夹操作日志搜集器](../../problemset/crawler-log-folder/README.md) | 简单 |
 | 1961. [检查字符串是否为数组前缀](../../problemset/check-if-string-is-a-prefix-of-array/README.md) | 简单 |
 | 2016. [增量元素之间的最大差值](../../problemset/maximum-difference-between-increasing-elements/README.md) | 简单 |
 | 2028. [找出缺失的观测数据](../../problemset/find-missing-observations/README.md) | 中等 |

assets/docs/TOPICS.md

@@ -924,6 +924,8 @@
 
 [1832. 判断句子是否为全字母句](../../problemset/check-if-the-sentence-is-pangram/README.md)
 
+[1958. 文件夹操作日志搜集器](../../problemset/crawler-log-folder/README.md)
+
 [1961. 检查字符串是否为数组前缀](../../problemset/check-if-string-is-a-prefix-of-array/README.md)
 
 [1984. 学生分数的最小差值](../../problemset/minimum-difference-between-highest-and-lowest-of-k-scores/README.md)

problemset/crawler-log-folder/README.md

@@ -0,0 +1,75 @@
+# 文件夹操作日志搜集器
+
+> 难度：简单
+>
+> https://leetcode.cn/problems/crawler-log-folder/
+
+## 题目
+
+每当用户执行变更文件夹操作时，`LeetCode` 文件系统都会保存一条日志记录。
+
+下面给出对变更操作的说明：
+
+- `"../"` ：移动到当前文件夹的父文件夹。如果已经在主文件夹下，则 继续停留在当前文件夹 。
+- `"./"` ：继续停留在当前文件夹。
+- `"x/"` ：移动到名为 `x` 的子文件夹中。题目数据 保证总是存在文件夹 `x` 。
+
+给你一个字符串列表 `logs` ，其中 `logs[i]` 是用户在 `ith` 步执行的操作。
+
+文件系统启动时位于主文件夹，然后执行 `logs` 中的操作。
+
+执行完所有变更文件夹操作后，请你找出 **返回主文件夹所需的最小步数** 。
+
+### 示例
+
+#### 示例 1：
+
+![image](https://user-images.githubusercontent.com/54696834/189265713-a7a070bf-d7f5-4d96-8cd6-1a2f8c429681.png)
+
+```
+输入：logs = ["d1/","d2/","../","d21/","./"]
+输出：2
+解释：执行 "../" 操作变更文件夹 2 次，即可回到主文件夹
+```
+
+#### 示例 2：
+
+![image](https://user-images.githubusercontent.com/54696834/189265732-a8bf17f3-25a7-4aec-9b89-1d64f69c3b8c.png)
+
+```
+输入：logs = ["d1/","d2/","./","d3/","../","d31/"]
+输出：3
+```
+
+#### 示例 3：
+
+```
+输入：logs = ["d1/","../","../","../"]
+输出：0
+```
+
+## 解题
+
+```ts 
+/**
+ * 模拟
+ * @desc 时间复杂度 O(N)  空间复杂度 O(1)
+ * @param logs
+ * @returns
+ */
+export function minOperations(logs: string[]): number {
+  let depth = 0
+  for (const log of logs) {
+    if (log === './') {
+      continue
+    }
+    else if (log === '../') {
+      if (depth > 0) depth--
+    }
+    else {
+      depth++
+    }
+  }
+  return depth
+}
+```

problemset/crawler-log-folder/index.spec.ts

@@ -0,0 +1,25 @@
+import { describe, expect, it } from 'vitest'
+import { minOperations } from '.'
+
+describe('文件夹操作日志搜集器', () => {
+  testCase(minOperations)
+})
+
+function testCase(fn: (logs: string[]) => number) {
+  it.each([
+    [
+      ['d1/', 'd2/', '../', 'd21/', './'],
+      2,
+    ],
+    [
+      ['d1/', 'd2/', './', 'd3/', '../', 'd31/'],
+      3,
+    ],
+    [
+      ['d1/', '../', '../', '../'],
+      0,
+    ],
+  ])('示例%#', (logs, expected) => {
+    expect(fn(logs)).toBe(expected)
+  })
+}

problemset/crawler-log-folder/index.ts

@@ -0,0 +1,21 @@
+/**
+ * 模拟
+ * @desc 时间复杂度 O(N)  空间复杂度 O(1)
+ * @param logs
+ * @returns
+ */
+export function minOperations(logs: string[]): number {
+  let depth = 0
+  for (const log of logs) {
+    if (log === './') {
+      continue
+    }
+    else if (log === '../') {
+      if (depth > 0) depth--
+    }
+    else {
+      depth++
+    }
+  }
+  return depth
+}