重复的子字符串

“重复的子字符串”
给定一个非空的字符串，判断它是否可以由它的一个子串重复多次构成。给定的字符串只含有小写英文字母，并且长度不超过10000。

示例 1:

输入: “abab”

输出: True

解释: 可由子字符串 “ab” 重复两次构成。
示例 2:

输入: “aba”

输出: False
示例 3:

输入: “abcabcabcabc”

输出: True

解释: 可由子字符串 “abc” 重复四次构成。 (或者子字符串 “abcabc” 重复两次构成。)¹

case 1:
start: s = “abab”
=> length = len(s) = 4
=> mid = length / 2 = 2
=> s[0: 1] = “a” => s[0: 1] * 4 = “aaaa” != s
=> s[0: 2] = “ab” => s[0: 2] * 2 = “abab” == s
=>end: True

case 2:
start: s = “ababc”
=> length = len(s) = 5
=> mid = length / 2 = 2
=> s[0: 1] = “a” => s[0: 1] * 4 = “aaaa” != s
=> s[0: 2] = “ab” => s[0: 2] * 2 = “abab” != s
=>end: False

"""
@author: WowlNAN
"""
class Solution:
    def repeatedSubstringPattern(self, s: str) -> bool:
        if not s:
            return False
        if len(s)==1:
            return False
        l=len(s)
        mid=l//2
        for i in range(1, mid+1):
            if l%i==0 and s[:i]*(l//i)==s:
                return True
        return False

case 1:
=> start: s = “abab”
=> s + s = “abababab”
=> (s + s)[1: -1] = “bababa”
=> s in (s + s)
=>end: True
²

class Solution:
    def repeatedSubstringPattern(self, s: str) -> bool:
        if not s:
            return False
        if len(s)==1:
            return False
        return (2*s)[1:-1].find(s)!=-1

---

1. 题目来源：力扣LeetCode ↩︎

2. 代码来源：力扣LeetCode提交范例 ↩︎