CrackerCat
diff --git a/‎note/028/README.md
Copy file name to clipboardExpand all lines: note/028/README.md
+2-2Lines changed: 2 additions & 2 deletions b/‎note/028/README.md
Copy file name to clipboardExpand all lines: note/028/README.md
+2-2Lines changed: 2 additions & 2 deletions
diff --git a/‎src/com/blankj/easy/_028/Solution.java
Copy file name to clipboardExpand all lines: src/com/blankj/easy/_028/Solution.java
+1-1Lines changed: 1 addition & 1 deletion b/‎src/com/blankj/easy/_028/Solution.java
Copy file name to clipboardExpand all lines: src/com/blankj/easy/_028/Solution.java
+1-1Lines changed: 1 addition & 1 deletion
@@ -25,17 +25,17 @@ Tags:** Two Pointers, String
 
 ## 思路
 
-题意是从主串中找到子串的索引，如果找不到则返回-1，当字串长度大于主串，直接返回-1，然后我们只需要遍历比较即可。
+题意是从主串中找到子串的索引，如果找不到则返回-1，当子串长度大于主串，直接返回-1，然后我们只需要遍历比较即可。
 
 ```java
 class Solution {
     public int strStr(String haystack, String needle) {
         int l1 = haystack.length(), l2 = needle.length();
         if (l1 < l2) return -1;
         for (int i = 0; ; i++) {
+            if (i + l2 > l1) return -1;
             for (int j = 0; ; j++) {
                 if (j == l2) return i;
-                if (i + j == l1) return -1;
                 if (haystack.charAt(i + j) != needle.charAt(j)) break;
             }
         }
 
@@ -13,9 +13,9 @@ public int strStr(String haystack, String needle) {
         int l1 = haystack.length(), l2 = needle.length();
         if (l1 < l2) return -1;
         for (int i = 0; ; i++) {
+            if (i + l2 > l1) return -1;
             for (int j = 0; ; j++) {
                 if (j == l2) return i;
-                if (i + j == l1) return -1;
                 if (haystack.charAt(i + j) != needle.charAt(j)) break;
             }
         }
Original file line number	Diff line number	Diff line change
`@@ -13,9 +13,9 @@ public int strStr(String haystack, String needle) {`
`13`	`13`	`int l1 = haystack.length(), l2 = needle.length();`
`14`	`14`	`if (l1 < l2) return -1;`
`15`	`15`	`for (int i = 0; ; i++) {`
	`16`	`+ if (i + l2 > l1) return -1;`
`16`	`17`	`for (int j = 0; ; j++) {`
`17`	`18`	`if (j == l2) return i;`
`18`		`- if (i + j == l1) return -1;`
`19`	`19`	`if (haystack.charAt(i + j) != needle.charAt(j)) break;`
`20`	`20`	`}`
`21`	`21`	`}`