Lintcode 1227. Repeated Substring Pattern (Easy) (Python)

最新推荐文章于 2023-02-25 23:03:36 发布

2Young2Simple

最新推荐文章于 2023-02-25 23:03:36 发布

阅读量141

点赞数

CC 4.0 BY-SA版权

文章标签： Lintcode Python

本文链接：https://blog.youkuaiyun.com/weixin_41677877/article/details/81014451

本文介绍了一种检测字符串是否由其子串重复拼接而成的方法。通过两种算法实现：一是遍历不同长度的子串并检查重复组合是否与原字符串匹配；二是利用字符串旋转特性判断。适用于字符串分析和模式识别等场景。

Repeated Substring Pattern

Description:

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

Code:

class Solution:
    """
    @param s: a string
    @return: return a boolean
    """

    def repeatedSubstringPattern(self, s):

        size = len(s)
        for x in range(1, int(size / 2 + 1)):
            if size % x:
                continue
            if s[:x] * (int(size / x)) == s:
                return True
        return False

class Solution:
    """
    @param s: a string
    @return: return a boolean
    """

    def repeatedSubstringPattern(self, s):
        tmp = s[1:]+s[:-1]
        return (tmp.find(s) != -1)