docs: 完全同步第28题英文版到 leetcoder.net 的原始内容

gazeldx · gazeldx · commit 503cec527592 · 2025-03-24T14:34:29.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,7 +1,7 @@
-Original link: [leetcoder.net - Fucking Good LeetCode Solutions](https://leetcoder.net/en/leetcode/28-find-the-index-of-the-first-occurrence-in-a-string)
+Original link: [leetcoder.net - LeetCoder: Fucking Good LeetCode Solutions](https://leetcoder.net/en/leetcode/28-find-the-index-of-the-first-occurrence-in-a-string)
 
-# 28. Find the Index of the First Occurrence in a String - Fucking Good LeetCode Solutions
-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**.
+# 28. Find the Index of the First Occurrence in a String - LeetCoder: Fucking Good LeetCode Solutions
+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 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`.
@@ -29,7 +29,6 @@ The first occurrence is at index 0, so we return 0.
 - `haystack` and `needle` consist of only lowercase English characters.
 
 ## Intuition
-
 - This kind of question can be solved with one line of code using the built-in `index()`. Obviously, the questioner wants to test our ability to control the loop.
 
 - For `heystack`, traverse each character in turn. There may be two situations:
@@ -39,59 +38,39 @@ The first occurrence is at index 0, so we return 0.
 - This question is easier to understand by looking at the code directly.
 
 ## Complexity
-* Time: `O(m + n)`.
-* Space: `O(n)`.
+- Time complexity: `O(N + M)`.
+- Space complexity: `O(1)`.
 
 ## Python
 ```python
 class Solution:
     def strStr(self, haystack: str, needle: str) -> int:
         for i in range(len(haystack)):
-            if haystack[i:i + len(needle)] == needle:
-                return i
-
+            j = 0
+            while i + j < len(haystack) and haystack[i + j] == needle[j]:
+                j += 1
+                if j == len(needle):
+                    return i
         return -1
 ```
 
 ## JavaScript
 ```javascript
 var strStr = function (haystack, needle) {
   for (let i = 0; i < haystack.length; i++) {
-    if (haystack.slice(i, i + needle.length) == needle) {
-      return i
+    let j = 0
+    while (i + j < haystack.length && haystack[i + j] == needle[j]) {
+      j += 1
+      if (j == needle.length) {
+        return i
+      }
     }
   }
-
   return -1
 };
 ```
 
-## C++
-```cpp
-// Welcome to create a PR to complete the code of this language, thanks!
-```
-
-## Java
+## Other languages
 ```java
 // Welcome to create a PR to complete the code of this language, thanks!
 ```
-
-## C#
-```c#
-// Welcome to create a PR to complete the code of this language, thanks!
-```
-
-## Go
-```go
-// Welcome to create a PR to complete the code of this language, thanks!
-```
-
-## Ruby
-```ruby
-# Welcome to create a PR to complete the code of this language, thanks!
-```
-
-## C, Kotlin, Swift, Rust or other languages
-```
-// Welcome to create a PR to complete the code of this language, thanks!
-```
