pythonprogram/Repeated_Substring_Pattern.py at master · s-sst/pythonprogram · GitHub

18 lines (16 loc) · 527 Bytes

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

class Solution:

def repeatedSubstringPattern(self, s: str) -> bool:

cal = run = 0

tem = s[:cal]

for i in range(len(s)):

cal += 1

tem = s[:cal]

# Jump is with the size of searching elelment i.e cal

for j in range(cal, len(s), cal):

if tem == s[j: j + cal]:

run = j + cal

if run == len(s):

return True

else:

break

return False