fix bug

biaodigit · biaodigit · commit cce921e1b2ef · 2018-10-18T23:06:07.000+08:00
diff --git a/Classical algorithm problem/Boyer-Moore.html b/Classical algorithm problem/Boyer-Moore.html
@@ -29,7 +29,7 @@
                     j--
                 } else {
                     lastIndex = badSuffix[text.charAt(i)] >= 0 ? badSuffix[text.charAt(i)] : -1;
-                    i += pLen - 1 - j + Math.max(j - lastIndex, goodSuffix[j]);
+                    i += pLen - 1 - j + Math.max(j - lastIndex, goodSuffix[j])
                     j = pLen - 1;
                 }
             }
@@ -38,7 +38,7 @@
 
 
         let computeBadSuffix = function () {
-            for (let j = pLen - 1; j >= 0; j--) {
+            for (let j = 0; j < pLen - 1; j++) {
                 badSuffix[pattern.charAt(j)] = j
             }
         };
@@ -84,7 +84,8 @@
         match()
     }
 
-    BoyerMoore("here is a simple example", "example")
+    BoyerMoore("here is a simple slexample", "slexample")
+    // BoyerMoore("abbadcababacab", "babac")
 </script>
 </body>
 </html>

Original file line number	Diff line number	Diff line change
`@@ -29,7 +29,7 @@`
`29`	`29`	`j--`
`30`	`30`	`} else {`
`31`	`31`	`lastIndex = badSuffix[text.charAt(i)] >= 0 ? badSuffix[text.charAt(i)] : -1;`
`32`		`- i += pLen - 1 - j + Math.max(j - lastIndex, goodSuffix[j]);`
	`32`	`+ i += pLen - 1 - j + Math.max(j - lastIndex, goodSuffix[j])`
`33`	`33`	`j = pLen - 1;`
`34`	`34`	`}`
`35`	`35`	`}`
`@@ -38,7 +38,7 @@`
`38`	`38`
`39`	`39`
`40`	`40`	`let computeBadSuffix = function () {`
`41`		`- for (let j = pLen - 1; j >= 0; j--) {`
	`41`	`+ for (let j = 0; j < pLen - 1; j++) {`
`42`	`42`	`badSuffix[pattern.charAt(j)] = j`
`43`	`43`	`}`
`44`	`44`	`};`
`@@ -84,7 +84,8 @@`
`84`	`84`	`match()`
`85`	`85`	`}`
`86`	`86`
`87`		`- BoyerMoore("here is a simple example", "example")`
	`87`	`+ BoyerMoore("here is a simple slexample", "slexample")`
	`88`	`+ // BoyerMoore("abbadcababacab", "babac")`
`88`	`89`	`</script>`
`89`	`90`	`</body>`
`90`	`91`	`</html>`