| 2 | using namespace std; |
| 3 | |
| 4 | void fillLPS(string s, int lps[]) |
| 5 | { |
| 6 | int n = s.length(); |
| 7 | int len = 0; |
| 8 | int i = 1; |
| 9 | lps[0] = 0; |
| 10 | while (i < n) |
| 11 | { |
| 12 | if (s[i] == s[len]) |
| 13 | { |
| 14 | len++; |
| 15 | lps[i] = len; |
| 16 | i++; |
| 17 | } |
| 18 | else |
| 19 | { |
| 20 | if (len == 0) |
| 21 | { |
| 22 | lps[i] = 0; |
| 23 | i++; |
| 24 | } |
| 25 | else |
| 26 | { |
| 27 | len = lps[len - 1]; |
| 28 | } |
| 29 | } |
| 30 | } |
| 31 | } |
| 32 | |
| 33 | void KMP(string txt, string pat) |
| 34 | { |