Leetcode 459. Repeated Substring Pattern

Given a non-empty string check if it can be constructed by taking a substring of it and appending multiple copies of the substring together. You may assume the given string consists of lowercase English letters only and its length will not exceed 10000.

Example 1:
Input: “abab”

Output: True

Explanation: It’s the substring “ab” twice.
Example 2:
Input: “aba”

Output: False
Example 3:
Input: “abcabcabcabc”

Output: True

Explanation: It’s the substring “abc” four times. (And the substring “abcabc” twice.)

这道题虽然是一个easy，但是我想复杂了。这里分享一个非常简洁的解法：

如果s 是repeated 的字符串，那么我们另String = s + s，这样String 一定是repeated 的，然后我们去掉String的第一个字符和最后一个字符，如果在String[1:-1] 还存在s，那么就说明s 是repeated，否则就说明s 不是repeated。

代码特别简洁：

class Solution(object):
    def repeatedSubstringPattern(self, s):
        return (2 * s)[1:-1].find(s) != -1