From f4ea34989e8a114259a5a9ca5501d831101e8475 Mon Sep 17 00:00:00 2001
From: joeCarf <52153761+joeCarf@users.noreply.github.com>
Date: Sat, 1 Jan 2022 23:08:04 +0800
Subject: [PATCH] =?UTF-8?q?[+]=20LeetCode=2028:=E5=89=8D=E7=BC=80=E8=A1=A8?=
 =?UTF-8?q?=EF=BC=88=E4=B8=8D=E5=87=8F=E4=B8=80=EF=BC=89Java=E5=AE=9E?=
 =?UTF-8?q?=E7=8E=B0?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/0028.实现strStr.md | 35 +++++++++++++++++++++++++++++++++++
 1 file changed, 35 insertions(+)

diff --git a/problems/0028.实现strStr.md b/problems/0028.实现strStr.md
index ef7008bc..f0b56719 100644
--- a/problems/0028.实现strStr.md
+++ b/problems/0028.实现strStr.md
@@ -649,6 +649,41 @@ class Solution {
 }
 ```
 
+```Java
+class Solution {
+    //前缀表（不减一）Java实现
+    public int strStr(String haystack, String needle) {
+        if (needle.length() == 0) return 0;
+        int[] next = new int[needle.length()];
+        getNext(next, needle);
+
+        int j = 0;
+        for (int i = 0; i < haystack.length(); i++) {
+            while (j > 0 && needle.charAt(j) != haystack.charAt(i)) 
+                j = next[j - 1];
+            if (needle.charAt(j) == haystack.charAt(i)) 
+                j++;
+            if (j == needle.length()) 
+                return i - needle.length() + 1;
+        }
+        return -1;
+
+    }
+    
+    private void getNext(int[] next, String s) {
+        int j = 0;
+        next[0] = 0;
+        for (int i = 1; i < s.length(); i++) {
+            while (j > 0 && s.charAt(j) != s.charAt(i)) 
+                j = next[j - 1];
+            if (s.charAt(j) == s.charAt(i)) 
+                j++;
+            next[i] = j; 
+        }
+    }
+}
+```
+
 Python3：
 
 ```python