【LeetCode】每日一题——686. 重复叠加字符串匹配
目录
题目:
思路:
刚刚好字符覆盖,或者差一个a字符
代码:
class Solution:
def repeatedStringMatch(self, a: str, b: str) -> int:
return l if (a * (l:=ceil(len(b)/len(a)))).find(b) != -1 else l + 1 if (a * (l + 1)).find(b) != -1 else -1
代码解读
return l if (a * (l:=ceil(len(b)/len(a)))).find(b) != -1 else {l + 1 if (a * (l + 1)).find(b) != -1 else -1 }
return l if (a*l能找到) else {
l+1 if (a*(l+1)能找到) else -1
}-1程序退出

参考链接:
https://leetcode-cn.com/problems/repeated-string-match/solution/pythonjavajavascriptgo-fu-gai-pi-pei-zhi-7m38/