Conditions | 4 |
Total Lines | 18 |
Lines | 0 |
Ratio | 0 % |
Changes | 1 | ||
Bugs | 0 | Features | 0 |
1 | |||
3 | @staticmethod |
||
4 | def lrs(text, pattern): |
||
5 | n = len(text) |
||
6 | a = [''] * n |
||
7 | for i in range(0, n): |
||
8 | a[i] = text[i:] |
||
9 | |||
10 | sorted(a) |
||
11 | |||
12 | max_len = 0 |
||
13 | j = -1 |
||
14 | for i in range(0, n): |
||
15 | l = LongestRepeatedSubstringSearch.lcp(a[i], pattern) |
||
16 | if l > max_len: |
||
17 | j = i |
||
18 | max_len = l |
||
19 | |||
20 | return (j, max_len) |
||
21 | |||
29 |