Time: 64 ms (16.28%), Space: 44.6 MB (5.19%) - LeetHub

Author: debaaryan

0028-find-the-index-of-the-first-occurrence-in-a-string/0028-find-the-index-of-the-first-occurrence-in-a-string.js

@@ -3,33 +3,6 @@
  * @param {string} needle
  * @return {number}
  */
-function LPSArrForPattern(pat) {
-  let [patLength, pre, suf] = [pat.length, 0, 1];
-  if (patLength === 0) return 0;
-
-  let lpsArr = new Array(patLength).fill(0);
-
-  while (suf < patLength) {
-    // match
-    if (pat[pre] === pat[suf]) {
-      lpsArr[suf] = pre + 1;
-      pre++;
-      suf++;
-    } else {
-      // mismatch and pre at 0
-      if (pre === 0) {
-        lpsArr[suf] = 0;
-        suf++;
-      } else {
-        // mismatch and pre not at 0
-        pre = lpsArr[pre - 1];
-      }
-    }
-  }
-
-  return lpsArr;
-}
-
 var strStr = function (str, pat) {
   let [strLength, patLength, first, second] = [str.length, pat.length, 0, 0];
 
@@ -52,4 +25,31 @@ var strStr = function (str, pat) {
 
   if (second === patLength) return first - second;
   return -1;
+
+  function LPSArrForPattern(pat) {
+    let [pre, suf] = [0, 1];
+    if (patLength === 0) return 0;
+
+    let lpsArr = new Array(patLength).fill(0);
+
+    while (suf < patLength) {
+      // match
+      if (pat[pre] === pat[suf]) {
+        lpsArr[suf] = pre + 1;
+        pre++;
+        suf++;
+      } else {
+        // mismatch and pre at 0
+        if (pre === 0) {
+          lpsArr[suf] = 0;
+          suf++;
+        } else {
+          // mismatch and pre not at 0
+          pre = lpsArr[pre - 1];
+        }
+      }
+    }
+
+    return lpsArr;
+  }
 };