[LEetCode][Python]459. Repeated Substring Pattern

2019年4月20日 174次阅读 来源: bluescorpio

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.)

一开始是没有思路的。。

    def repeatedSubstringPattern2(self, str):
        """
        :type str: str
        :rtype: bool
        """
        ss = (str * 2)[1:-1]
        print ss
        return str in ss
    原文作者：bluescorpio
    原文地址: https://www.jianshu.com/p/5c6152c2dda9
    本文转自网络文章，转载此文章仅为分享知识，如有侵权，请联系博主进行删除。
点赞