From 5ab8a5088b729a9953b8dff1b2a985dc8fb2098b Mon Sep 17 00:00:00 2001
From: mzuenni <michi.zuendorf@gmail.com>
Date: Mon, 27 Jun 2022 17:19:28 +0200
Subject: updated tcr

---
 string/kmp.cpp | 44 +++++++++++++++++++++-----------------------
 1 file changed, 21 insertions(+), 23 deletions(-)

(limited to 'string/kmp.cpp')

diff --git a/string/kmp.cpp b/string/kmp.cpp
index 450b368..282019e 100644
--- a/string/kmp.cpp
+++ b/string/kmp.cpp
@@ -1,25 +1,23 @@
-// Laufzeit: O(n + m), n = #Text, m = #Pattern
-vector<int> kmpPreprocessing(string &sub) {
-  vector<int> b(sub.length() + 1);
-  b[0] = -1;
-  int i = 0, j = -1;
-  while (i < (int)sub.length()) {
-    while (j >= 0 && sub[i] != sub[j]) j = b[j];
-    i++; j++;
-    b[i] = j;
-  }
-  return b;
+vector<int> kmpPreprocessing(const string& sub) {
+	vector<int> b(sub.size() + 1);
+	b[0] = -1;
+	int i = 0, j = -1;
+	while (i < (int)sub.size()) {
+		while (j >= 0 && sub[i] != sub[j]) j = b[j];
+		i++; j++;
+		b[i] = j;
+	}
+	return b;
 }
-
-vector<int> kmpSearch(string &s, string &sub) {
-  vector<int> pre = kmpPreprocessing(sub), result;
-  int i = 0, j = 0;
-  while (i < (int)s.length()) {
-    while (j >= 0 && s[i] != sub[j]) j = pre[j];
-    i++; j++;
-    if (j == (int)sub.length()) {
-      result.push_back(i - j);
-      j = pre[j];
-  }}
-  return result;
+vector<int> kmpSearch(const string& s, const string& sub) {
+	vector<int> pre = kmpPreprocessing(sub), result;
+	int i = 0, j = 0;
+	while (i < (int)s.size()) {
+		while (j >= 0 && s[i] != sub[j]) j = pre[j];
+		i++; j++;
+		if (j == (int)sub.size()) {
+			result.push_back(i - j);
+			j = pre[j];
+	}}
+	return result;
 }
-- 
cgit v1.2.3