2022-03-27 20:52:13 +08:00
< p > Given a string < code > s< / code > , check if it can be constructed by taking a substring of it and appending multiple copies of the substring together.< / p >
< p > < / p >
2023-12-09 18:42:21 +08:00
< p > < strong class = "example" > Example 1:< / strong > < / p >
2022-03-27 20:52:13 +08:00
< pre >
< strong > Input:< / strong > s = " abab"
< strong > Output:< / strong > true
< strong > Explanation:< / strong > It is the substring " ab" twice.
< / pre >
2023-12-09 18:42:21 +08:00
< p > < strong class = "example" > Example 2:< / strong > < / p >
2022-03-27 20:52:13 +08:00
< pre >
< strong > Input:< / strong > s = " aba"
< strong > Output:< / strong > false
< / pre >
2023-12-09 18:42:21 +08:00
< p > < strong class = "example" > Example 3:< / strong > < / p >
2022-03-27 20:52:13 +08:00
< pre >
< strong > Input:< / strong > s = " abcabcabcabc"
< strong > Output:< / strong > true
< strong > Explanation:< / strong > It is the substring " abc" four times or the substring " abcabc" twice.
< / pre >
< p > < / p >
< p > < strong > Constraints:< / strong > < / p >
< ul >
< li > < code > 1 < = s.length < = 10< sup > 4< / sup > < / code > < / li >
< li > < code > s< / code > consists of lowercase English letters.< / li >
< / ul >