28-find-the-index-of-the-first-occurrence-in-a-string.md Separated Chinese and English solutions.

gazeldx · gazeldx · commit 079bb7de2d10 · 2025-02-04T11:35:35.000+08:00
diff --git a/en/1-1000/28-find-the-index-of-the-first-occurrence-in-a-string.md b/en/1-1000/28-find-the-index-of-the-first-occurrence-in-a-string.md
@@ -1,15 +1,9 @@
 # 28. Find the Index of the First Occurrence in a String - Best Practices of LeetCode Solutions
-LeetCode English link: [28. Find the Index of the First Occurrence in a String](https://leetcode.com/problems/find-the-index-of-the-first-occurrence-in-a-string)
+LeetCode link: [28. Find the Index of the First Occurrence in a String](https://leetcode.com/problems/find-the-index-of-the-first-occurrence-in-a-string), difficulty: **Easy**.
 
-LeetCode Chinese link: [28. 找出字符串中第一个匹配项的下标](https://leetcode.cn/problems/find-the-index-of-the-first-occurrence-in-a-string)
-
-[中文题解](#中文题解)
-
-## LeetCode problem description
+## Description of "28. Find the Index of the First Occurrence in a String"
 Given two strings `needle` and `haystack`, return the **index** of the first occurrence of `needle` in `haystack`, or `-1` if `needle` is not part of `haystack`.
 
-Difficulty: **Easy**
-
 ### [Example 1]
 **Input**: `haystack = "sadbutsad", needle = "sad"`
 
@@ -33,8 +27,6 @@ The first occurrence is at index 0, so we return 0.
 - `haystack` and `needle` consist of only lowercase English characters.
 
 ## Intuition
-[中文题解](#中文题解)
-
 Traverse the string once, and if the `needle.length` characters after the current position are equal to `needle`, return the current `index`.
 
 ## Complexity
@@ -94,22 +86,3 @@ var strStr = function (haystack, needle) {
 ```
 // Welcome to create a PR to complete the code of this language, thanks!
 ```
-
-## 力扣“28. 找出字符串中第一个匹配项的下标”问题描述
-力扣链接：[28. 找出字符串中第一个匹配项的下标](https://leetcode.cn/problems/find-the-index-of-the-first-occurrence-in-a-string), 难度: **简单**。
-
-给你两个字符串 `haystack` 和 `needle` ，请你在 `haystack` 字符串中找出 `needle` 字符串的第一个匹配项的下标（下标从 `0` 开始）。如果 `needle` 不是 `haystack` 的一部分，则返回 `-1` 。
-
-### [示例 1]
-**输入**: `haystack = "sadbutsad", needle = "sad"`
-
-**输出**: `0`
-
-### [示例 1]
-**输入**: `haystack = "leetcode", needle = "leeto"`
-
-**输出**: `-1`
-
-# 中文题解
-## 思路
-遍历一遍字符串，如果从当前位置起的后的`needle.length`个字符等于`needle`，则返回当前的`index`。
diff --git a/en/3001-4000/unorganized.md b/en/3001-4000/unorganized.md
@@ -114,12 +114,33 @@ The improved way with a queue is commonly more efficient. Relaxing **All Edges**
 - 538 https://leetcode.cn/problems/convert-bst-to-greater-tree/
 
 ### Backtracking
-- 77 https://leetcode.cn/problems/combinations/description/
+- 77 https://leetcode.cn/problems/combinations/
 - 216 https://leetcode.cn/problems/combination-sum-iii/
-- 17 https://leetcode.cn/problems/letter-combinations-of-a-phone-number/
 - 39 https://leetcode.cn/problems/combination-sum/
-- 
+- 17 https://leetcode.cn/problems/letter-combinations-of-a-phone-number/
+- 78 https://leetcode.cn/problems/subsets/
+- 90 https://leetcode.cn/problems/subsets-ii/
+- 40 https://leetcode.cn/problems/combination-sum-ii/
+- 131 https://leetcode.cn/problems/palindrome-partitioning/
+- 93 https://leetcode.cn/problems/restore-ip-addresses/
+- 491 https://leetcode.cn/problems/non-decreasing-subsequences/
+- 46 https://leetcode.cn/problems/permutations/
+- 332 https://leetcode.cn/problems/reconstruct-itinerary/
+- 51 https://leetcode.cn/problems/n-queens/
+
+### Greedy Algorithm
+- 455 https://leetcode.cn/problems/assign-cookies/
+- 376 https://leetcode.cn/problems/wiggle-subsequence/
+- 53 https://leetcode.cn/problems/maximum-subarray/
+- 122 https://leetcode.cn/problems/best-time-to-buy-and-sell-stock-ii/
 
 ### Failed in 2 rounds
 - 222 https://leetcode.cn/problems/count-complete-tree-nodes/
 - 236 https://leetcode.cn/problems/lowest-common-ancestor-of-a-binary-tree/
+- 40 https://leetcode.cn/problems/combination-sum-ii/
+- 131 https://leetcode.cn/problems/palindrome-partitioning/
+- 332 https://leetcode.cn/problems/reconstruct-itinerary/
+- 51 https://leetcode.cn/problems/n-queens/
+- 37 https://leetcode.cn/problems/sudoku-solver
+
+2005-02-04 day 7
diff --git a/zh/1-1000/28-find-the-index-of-the-first-occurrence-in-a-string.md b/zh/1-1000/28-find-the-index-of-the-first-occurrence-in-a-string.md
@@ -1,45 +1,37 @@
-# 28. Find the Index of the First Occurrence in a String - Best Practices of LeetCode Solutions
-LeetCode English link: [28. Find the Index of the First Occurrence in a String](https://leetcode.com/problems/find-the-index-of-the-first-occurrence-in-a-string)
-
-LeetCode Chinese link: [28. 找出字符串中第一个匹配项的下标](https://leetcode.cn/problems/find-the-index-of-the-first-occurrence-in-a-string)
-
-[中文题解](#中文题解)
-
-## LeetCode problem description
-Given two strings `needle` and `haystack`, return the **index** of the first occurrence of `needle` in `haystack`, or `-1` if `needle` is not part of `haystack`.
+# 28. 找出字符串中第一个匹配项的下标 - 力扣题解最佳实践
+力扣链接：[28. 找出字符串中第一个匹配项的下标](https://leetcode.cn/problems/find-the-index-of-the-first-occurrence-in-a-string), 难度: **简单**。
 
-Difficulty: **Easy**
+## 力扣“28. 找出字符串中第一个匹配项的下标”问题描述
+给你两个字符串 `haystack` 和 `needle` ，请你在 `haystack` 字符串中找出 `needle` 字符串的第一个匹配项的下标（下标从 `0` 开始）。如果 `needle` 不是 `haystack` 的一部分，则返回 `-1` 。
 
-### [Example 1]
-**Input**: `haystack = "sadbutsad", needle = "sad"`
+### [示例 1]
+**输入**: `haystack = "sadbutsad", needle = "sad"`
 
-**Output**: `0`
+**输出**: `0`
 
-**Explanation**:
+**解释**:
 ```
-"sad" occurs at index 0 and 6.
-The first occurrence is at index 0, so we return 0.
+"sad" 在下标 0 和 6 处匹配。
+第一个匹配项的下标是 0 ，所以返回 0 。
 ```
 
-### [Example 2]
-**Input**: `haystack = "leetcode", needle = "leeto"`
+### [示例 2]
+**输入**: `haystack = "leetcode", needle = "leeto"`
 
-**Output**: `-1`
+**输出**: `-1`
 
-**Explanation**: `"leeto" did not occur in "leetcode", so we return -1.`
+**解释**: `"leeto" 没有在 "leetcode" 中出现，所以返回 -1 。`
 
-### [Constraints]
+### [约束]
 - `1 <= haystack.length, needle.length <= 10000`
-- `haystack` and `needle` consist of only lowercase English characters.
-
-## Intuition
-[中文题解](#中文题解)
+- `haystack` 和 `needle` 仅由小写英文字符组成
 
-Traverse the string once, and if the `needle.length` characters after the current position are equal to `needle`, return the current `index`.
+## 思路
+遍历一遍字符串，如果从当前位置起的后的`needle.length`个字符等于`needle`，则返回当前的`index`。
 
-## Complexity
-* Time: `O(m * n)`.
-* Space: `O(n)`.
+## 复杂度
+* 时间：`O(m * n)`。
+* 空间：`O(n)`。
 
 ## Python
 ```python
@@ -94,22 +86,3 @@ var strStr = function (haystack, needle) {
 ```
 // Welcome to create a PR to complete the code of this language, thanks!
 ```
-
-## 力扣“28. 找出字符串中第一个匹配项的下标”问题描述
-力扣链接：[28. 找出字符串中第一个匹配项的下标](https://leetcode.cn/problems/find-the-index-of-the-first-occurrence-in-a-string), 难度: **简单**。
-
-给你两个字符串 `haystack` 和 `needle` ，请你在 `haystack` 字符串中找出 `needle` 字符串的第一个匹配项的下标（下标从 `0` 开始）。如果 `needle` 不是 `haystack` 的一部分，则返回 `-1` 。
-
-### [示例 1]
-**输入**: `haystack = "sadbutsad", needle = "sad"`
-
-**输出**: `0`
-
-### [示例 1]
-**输入**: `haystack = "leetcode", needle = "leeto"`
-
-**输出**: `-1`
-
-# 中文题解
-## 思路
-遍历一遍字符串，如果从当前位置起的后的`needle.length`个字符等于`needle`，则返回当前的`index`。
