FilesExpand file tree

 master

/

repeat_string.py

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

24 lines (19 loc) · 748 Bytes

 master

/

repeat_string.py

Copy path

Top

File metadata and controls

• Code
• Blame

24 lines (19 loc) · 748 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

"""

Given two strings A and B, find the minimum number of times A has to be repeated such that B is a substring of it. If no such solution, return -1.

For example, with A = "abcd" and B = "cdabcdab".

Return 3, because by repeating A three times (“abcdabcdabcd”), B is a substring of it; and B is not a substring of A repeated two times ("abcdabcd").

Note:

The length of A and B will be between 1 and 10000.

Reference: https://leetcode.com/problems/repeated-string-match/description/

"""

def repeat_string(A, B):

count = 1

tmp = A

max_count = (len(B) / len(A)) + 1

while not(B in tmp):

tmp = tmp + A

if (count > max_count):

count = -1

break

count = count + 1

return count