题目:原题链接(简单)
标签:字符串
解法 | 时间复杂度 | 空间复杂度 | 执行用时 |
---|---|---|---|
Ans 1 (Python) | O ( N 2 ) O(N^2) O(N2) | O ( N ) O(N) O(N) | 108ms (83.43%) |
Ans 2 (Python) | O ( N ) O(N) O(N) | O ( N ) O(N) O(N) | 32ms (100.00%) |
Ans 3 (Python) |
解法一(暴力解法):
def repeatedStringMatch(self, A: str, B: str) -> int:
times = len(B) // len(A) + 2
n = A * times
if B in n:
n = A * (times - 1)
if B in n:
n = A * (times - 2)
if B in n:
return times - 2
else:
return times - 1
else:
return times
else:
return -1
解法二(增加前置判断):
[外链图片转存失败,源站可能有防盗链机制,建议将图片保存下来直接上传(img-fsM4a6rt-1597650788583)(LeetCode题解(0686)]:截图1.png)
class Solution:
def repeatedStringMatch(self, A: str, B: str) -> int:
if not set(B).issubset(set(A)):
return -1
size = len(B) // len(A)
for i in range(size, size + 3):
if B in A * i:
return i
return -1