adding string chapter

6 files changed, 19 insertions, 5 deletions

diff --git a/sonstiges/LCSub.cpp b/string/LCSubstring.cpp
index 69d636f..69d636f 100644
--- a/sonstiges/LCSub.cpp
+++ b/string/LCSubstring.cpp
diff --git a/string/string.tex b/string/string.tex
new file mode 100644
index 0000000..1335c4a
--- /dev/null
+++ b/string/string.tex
@@ -0,0 +1,13 @@
+\section{Strings}
+
+\subsection{\textsc{Knuth-Morris-Pratt}-Algorithmus}
+\lstinputlisting{string/kmp.cpp}
+
+\subsection{Trie}
+\lstinputlisting{string/trie.cpp}
+
+\subsection{Suffix-Array}
+\lstinputlisting{string/suffixArray.cpp}
+
+\subsection{Longest Common Substring}
+\lstinputlisting{string/LCSubstring.cpp}
diff --git a/sonstiges/SufixArray.cpp b/string/suffixArray.cpp
index bb742f6..2b2a87b 100644
--- a/sonstiges/SufixArray.cpp
+++ b/string/suffixArray.cpp
@@ -1,10 +1,10 @@
 //longest common substring in one string (overlapping not excluded)
-//contains suffix array:---------------------------------------------------------------------------------------------------------
+//contains suffix array:--------------------------------------------------------------------
 int cmp(string &s,vector<vector<int>> &v, vector<int> &a, int i, int vi, int u, int l) {
 	int vi2 = (vi + 1) % 2, u2 = u + i / 2, l2 = l + i / 2; 
 	if(i == 1) return s[u] - s[l];
 	else if (v[vi2][u] != v[vi2][l]) return (v[vi2][u] - v[vi2][l]);
-	else { //beide größer tifft nicht mehr ein, da ansonsten vorher schon unterschied in länge
+	else { //beide groesser tifft nicht mehr ein, da ansonsten vorher schon unterschied in Laenge
 		if(u2 >= s.length()) return -1;
 		else if(l2 >= s.length()) return 1;
 		else return v[vi2][u2] - v[vi2][l2];
@@ -24,7 +24,7 @@ string lcsub(string s) {
 		v[vi][a[0]] = 0;
 		for(int z = 1; z < a.size(); z++) v[vi][a[z]] = v[vi][a[z-1]] + (cmp(s, v, a, i, vi, a[z], a[z-1]) == 0 ? 0 : 1);
 	}
-//-------------------------------------------------------------------------------------------------------------------------------
+//-------------------------------------------------------------------------------------------
 	int r = 0, m=0, c=0;
 	for(int i = 0; i < a.size() - 1; i++) {
 		c = 0;
diff --git a/datastructures/trie.cpp b/string/trie.cpp
index 9cfcda5..f4b979c 100644
--- a/datastructures/trie.cpp
+++ b/string/trie.cpp
@@ -1,7 +1,7 @@
-//nur für kleinbuchstaben!
+//nur fuer kleinbuchstaben!
 struct node {
 	node *(e)[26];
-	int c = 0;//anzahl der wörter die an dem node enden.
+	int c = 0;//anzahl der woerter die an dem node enden.
 	node() { for(int i = 0; i < 26; i++) e[i] = NULL; }	
 };
 
diff --git a/tcr.pdf b/tcr.pdf
index c4e7d62..345a1a7 100644
--- a/tcr.pdf
+++ b/tcr.pdf
diff --git a/tcr.tex b/tcr.tex
index 4dce95e..4328b73 100644
--- a/tcr.tex
+++ b/tcr.tex
@@ -56,6 +56,7 @@
 \input{graph/graph}
 \input{geometry/geometry}
 \input{math/math}
+\input{string/string}
 \input{sonstiges/sonstiges}
 
 \end{document}
\ No newline at end of file