feat: leetcode 796

Author: deweyou

assets/data/category.json

@@ -1325,6 +1325,12 @@
         "path": "../../problemset/self-dividing-numbers/README.md",
         "difficulty": "简单"
       },
+      {
+        "id": 796,
+        "title": "旋转字符串",
+        "path": "../../problemset/rotate-string/README.md",
+        "difficulty": "简单"
+      },
       {
         "id": 798,
         "title": "得分最高的最小轮调",

assets/data/problems.json

@@ -2249,6 +2249,16 @@
     "url": "https://leetcode-cn.com/problems/prime-number-of-set-bits-in-binary-representation/",
     "path": "../../problemset/prime-number-of-set-bits-in-binary-representation/README.md"
   },
+  {
+    "id": 796,
+    "title": {
+      "cn": "旋转字符串",
+      "en": "rotate-string"
+    },
+    "difficulty": "简单",
+    "url": "https://leetcode-cn.com/problems/rotate-string/",
+    "path": "../../problemset/rotate-string/README.md"
+  },
   {
     "id": 798,
     "title": {

assets/docs/CATEGORY.md

@@ -262,6 +262,7 @@
 | 661. [图片平滑器](../../problemset/image-smoother/README.md) | 简单 |
 | 682. [棒球比赛](../../problemset/baseball-game/README.md) | 简单 |
 | 728. [自除数](../../problemset/self-dividing-numbers/README.md) | 简单 |
+| 796. [旋转字符串](../../problemset/rotate-string/README.md) | 简单 |
 | 798. [得分最高的最小轮调](../../problemset/smallest-rotation-with-highest-score/README.md) | 困难 |
 | 838. [推多米诺](../../problemset/push-dominoes/README.md) | 中等 |
 | 969. [煎饼排序](../../problemset/pancake-sorting/README.md) | 中等 |

assets/docs/PROBLEMS.md

@@ -450,6 +450,8 @@
 
 [762. 二进制表示中质数个计算置位](../../problemset/prime-number-of-set-bits-in-binary-representation/README.md)
 
+[796. 旋转字符串](../../problemset/rotate-string/README.md)
+
 [798. 得分最高的最小轮调](../../problemset/smallest-rotation-with-highest-score/README.md)
 
 [838. 推多米诺](../../problemset/push-dominoes/README.md)

problemset/rotate-string/README.md

@@ -0,0 +1,74 @@
+# 旋转字符串
+
+> 难度：简单
+>
+> https://leetcode-cn.com/problems/rotate-string/
+
+## 题目
+
+给定两个字符串, `s` 和 `goal`。如果在若干次旋转操作之后，`s` 能变成 `goal` ，那么返回 `true` 。
+
+`s` 的 **旋转操作** 就是将 `s `最左边的字符移动到最右边。 
+
+例如, 若 `s = 'abcde'`，在旋转一次之后结果就是`'bcdea'` 。
+ 
+### 示例
+
+#### 示例 1:
+
+```
+输入: s = "abcde", goal = "cdeab"
+输出: true
+```
+
+#### 示例 2:
+
+```
+输入: s = "abcde", goal = "abced"
+输出: false
+```
+
+## 解题
+
+### 模拟
+
+```ts
+/**
+ * 模拟
+ * @desc 时间复杂度 O(N)  空间复杂度 O(N)
+ * @param s
+ * @param goal
+ * @returns
+ */
+export function rotateString(s: string, goal: string): boolean {
+  if (s.length !== goal.length) return false
+  if (s === goal) return true
+
+  const len = s.length
+  const goalFirst = goal.charAt(0)
+  for (let i = 0; i < len; i++) {
+    if (
+      s.charAt(i + 1) === goalFirst
+      && s.substring(i + 1, len) + s.substring(0, i + 1) === goal
+    ) return true
+  }
+
+  return false
+}
+```
+
+
+### 搜索子字符串
+
+```ts
+/**
+ * 搜索子字符串
+ * @desc 时间复杂度 O(N)  空间复杂度 O(N)
+ * @param s
+ * @param goal
+ * @returns
+ */
+export function rotateString2(s: string, goal: string): boolean {
+  return s.length === goal.length && (s + s).includes(goal)
+}
+```

problemset/rotate-string/index.spec.ts

@@ -0,0 +1,22 @@
+import { describe, expect, it } from 'vitest'
+import { rotateString, rotateString2 } from '.'
+
+describe('旋转字符串', () => {
+  describe('模拟', () => {
+    testCase(rotateString)
+  })
+
+  describe('搜索子字符串', () => {
+    testCase(rotateString2)
+  })
+})
+
+function testCase(fn: (s: string, goal: string) => boolean) {
+  it.each([
+    ['abcde', 'cdeab', true],
+    ['abcde', 'abced', false],
+    ['clrwmpkwru', 'wmpkwruclr', true],
+  ])('示例%#', (s, goal, expected) => {
+    expect(fn(s, goal)).toBe(expected)
+  })
+}

problemset/rotate-string/index.ts

@@ -0,0 +1,33 @@
+/**
+ * 模拟
+ * @desc 时间复杂度 O(N)  空间复杂度 O(N)
+ * @param s
+ * @param goal
+ * @returns
+ */
+export function rotateString(s: string, goal: string): boolean {
+  if (s.length !== goal.length) return false
+  if (s === goal) return true
+
+  const len = s.length
+  const goalFirst = goal.charAt(0)
+  for (let i = 0; i < len; i++) {
+    if (
+      s.charAt(i + 1) === goalFirst
+      && s.substring(i + 1, len) + s.substring(0, i + 1) === goal
+    ) return true
+  }
+
+  return false
+}
+
+/**
+ * 搜索子字符串
+ * @desc 时间复杂度 O(N)  空间复杂度 O(N)
+ * @param s
+ * @param goal
+ * @returns
+ */
+export function rotateString2(s: string, goal: string): boolean {
+  return s.length === goal.length && (s + s).includes(goal)
+}