docs: 同步第28题到 leetcoder.net 的原始内容

gazeldx · gazeldx · commit 71d313d5c40a · 2025-03-24T14:19:45.000+08:00
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
@@ -38,16 +38,21 @@
 - 本题直接看答案比较容易理解。
 
 ## 复杂度
-* 时间：`O(m * n)`。
+* 时间：`O(m + n)`。
 * 空间：`O(n)`。
 
 ## 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
 ```
@@ -56,8 +61,14 @@ class Solution:
 ```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
+      }
     }
   }
 
@@ -90,7 +101,27 @@ var strStr = function (haystack, needle) {
 # Welcome to create a PR to complete the code of this language, thanks!
 ```
 
-## C, Kotlin, Swift, Rust or other languages
+## C
+```c
+// Welcome to create a PR to complete the code of this language, thanks!
+```
+
+## Kotlin
+```kotlin
+// Welcome to create a PR to complete the code of this language, thanks!
+```
+
+## Swift
+```swift
+// Welcome to create a PR to complete the code of this language, thanks!
+```
+
+## Rust
+```rust
+// Welcome to create a PR to complete the code of this language, thanks!
+```
+
+## Other languages
 ```
 // Welcome to create a PR to complete the code of this language, thanks!
 ```
