feat: leetcode 522

Author: deweyou

README.md

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

@@ -3332,6 +3332,12 @@
         "path": "./problemset/largest-palindrome-product/README.md",
         "difficulty": "困难"
       },
+      {
+        "id": "522",
+        "title": "最长特殊序列 II",
+        "path": "./problemset/longest-uncommon-subsequence-2/README.md",
+        "difficulty": "中等"
+      },
       {
         "id": "699",
         "title": "掉落的方块",

assets/data/topics.json

@@ -3029,6 +3029,16 @@
     "url": "https://leetcode-cn.com/problems/longest-uncommon-subsequence-i/",
     "path": "./problemset/longest-uncommon-subsequence/README.md"
   },
+  {
+    "id": "522",
+    "title": {
+      "cn": "最长特殊序列 II",
+      "en": "longest-uncommon-subsequence-2"
+    },
+    "difficulty": "中等",
+    "url": "https://leetcode.cn/problems/longest-uncommon-subsequence-ii/",
+    "path": "./problemset/longest-uncommon-subsequence-2/README.md"
+  },
   {
     "id": "532",
     "title": {

assets/docs/CATEGORIES.md

@@ -634,6 +634,7 @@
 | ---- | ---- |
 | 204. [计数质数](../../problemset/count-primes/README.md) | 中等 |
 | 479. [最大回文数乘积](../../problemset/largest-palindrome-product/README.md) | 困难 |
+| 522. [最长特殊序列 II](../../problemset/longest-uncommon-subsequence-2/README.md) | 中等 |
 | 699. [掉落的方块](../../problemset/falling-squares/README.md) | 困难 |
 | 812. [最大三角形面积](../../problemset/largest-triangle-area/README.md) | 简单 |
 | 1601. [最多可达成的换楼请求数目](../../problemset/maximum-number-of-achievable-transfer-requests/README.md) | 困难 |

assets/docs/TOPICS.md

@@ -606,6 +606,8 @@
 
 [521. 最长特殊序列](../../problemset/longest-uncommon-subsequence/README.md)
 
+[522. 最长特殊序列 II](../../problemset/longest-uncommon-subsequence-2/README.md)
+
 [532. 数组中的 k-diff 数对](../../problemset/k-diff-pairs-in-an-array/README.md)
 
 [537. 复数乘法](../../problemset/complex-number-multiplication/README.md)

problemset/longest-uncommon-subsequence-2/README.md

@@ -0,0 +1,70 @@
+# 最长特殊序列 II
+
+> 难度：中等
+>
+> https://leetcode.cn/problems/longest-uncommon-subsequence-ii/
+
+## 题目
+
+给定字符串列表 `strs` ，返回其中 最长的特殊序列 。如果最长特殊序列不存在，返回` -1` 。
+
+**特殊序列** 定义如下：该序列为某字符串** 独有的子序列（即不能是其他字符串的子序列）**。
+
+ `s` 的 子序列可以通过删去字符串 `s` 中的某些字符实现。
+
+- 例如，`"abc"` 是 `"aebdc"` 的子序列，因为您可以删除`"aebdc"`中的下划线字符来得到 `"abc" `。`"aebdc"`的子序列还包括`"aebdc"`、 `"aeb"` 和 `""` (空字符串)。
+ 
+### 示例
+
+#### 示例 1：
+
+```
+输入: strs = ["aba","cdc","eae"]
+输出: 3
+```
+
+#### 示例 2:
+```
+输入: strs = ["aaa","aaa","aa"]
+输出: -1
+```
+
+## 解题
+
+```ts 
+/**
+ * 枚举每个字符串
+ * @desc 时间复杂度 O(N²) 空间复杂度 O(1)
+ * @param strs
+ * @returns
+ */
+export function findLUSlength(strs: string[]): number {
+  const len = strs.length
+  let ans = -1
+  for (let i = 0; i < len; i++) {
+    let check = true
+    for (let j = 0; j < len; j++) {
+      if (i !== j && isSubseq(strs[i], strs[j])) {
+        check = false
+        break
+      }
+    }
+
+    if (check)
+      ans = Math.max(ans, strs[i].length)
+  }
+
+  return ans
+
+  function isSubseq(s: string, t: string) {
+    let ptS = 0
+    let ptT = 0
+    while (ptS < s.length && ptT < t.length) {
+      if (s[ptS] === t[ptT]) ptS++
+
+      ptT++
+    }
+    return ptS === s.length
+  }
+}
+```

problemset/longest-uncommon-subsequence-2/index.spec.ts

@@ -0,0 +1,21 @@
+import { describe, expect, it } from 'vitest'
+import { findLUSlength } from '.'
+
+describe('最长特殊序列 II', () => {
+  testCase(findLUSlength)
+})
+
+function testCase(fn: (strs: string[]) => number) {
+  it.each([
+    [
+      ['aba', 'cdc', 'eae'],
+      3,
+    ],
+    [
+      ['aaa', 'aaa', 'aa'],
+      -1,
+    ],
+  ])('示例%#', (strs, expected) => {
+    expect(fn(strs)).toBe(expected)
+  })
+}

problemset/longest-uncommon-subsequence-2/index.ts

@@ -0,0 +1,35 @@
+/**
+ * 枚举每个字符串
+ * @desc 时间复杂度 O(N²) 空间复杂度 O(1)
+ * @param strs
+ * @returns
+ */
+export function findLUSlength(strs: string[]): number {
+  const len = strs.length
+  let ans = -1
+  for (let i = 0; i < len; i++) {
+    let check = true
+    for (let j = 0; j < len; j++) {
+      if (i !== j && isSubseq(strs[i], strs[j])) {
+        check = false
+        break
+      }
+    }
+
+    if (check)
+      ans = Math.max(ans, strs[i].length)
+  }
+
+  return ans
+
+  function isSubseq(s: string, t: string) {
+    let ptS = 0
+    let ptT = 0
+    while (ptS < s.length && ptT < t.length) {
+      if (s[ptS] === t[ptT]) ptS++
+
+      ptT++
+    }
+    return ptS === s.length
+  }
+}