Total Complexity | 1 |
Total Lines | 6 |
Duplicated Lines | 0 % |
Changes | 1 | ||
Bugs | 0 | Features | 0 |
1 | import unittest |
||
6 | class LongestRepeatedSubstringSearchUnitTest(unittest.TestCase): |
||
7 | |||
8 | def test_lrs(self): |
||
9 | start, len = LongestRepeatedSubstringSearch.lrs('Hello World', 'World Record') |
||
10 | print('Hello World'[start:(start+len+1)]) |
||
11 | self.assertEqual('World', 'Hello World'[start:(start+len+1)]) |
||
12 | |||
15 | unittest.main() |