【leetcode】459. Repeated Substring Pattern【E】

最新推荐文章于 2025-04-01 17:03:08 发布

原创最新推荐文章于 2025-04-01 17:03:08 发布 · 898 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#string #substring

Python 同时被 3 个专栏收录

176 篇文章

订阅专栏

leetcode

175 篇文章

订阅专栏

算法

157 篇文章

订阅专栏

本文介绍了一种算法，用于检查一个非空字符串是否可以通过其子串的多次重复拼接而成。通过实例展示了如何使用该方法判断特定字符串是否符合要求。

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

Subscribe to see which companies asked this question

就是从1开始，对每个长度的子串，找是不是按照它重复的

如果长度不能被整除，跳过

判断的时候利用集合，还是很好用的

class Solution(object):
    def repeatedSubstringPattern(self, str):
        
        l = len(str)
        
        for i in xrange(1,l):
            if l % i != 0:
                continue
            t = str[:i]
            
            #print t
            
            s = set(str.split(t))
            #print s
            
            if len(s) == 1:
                return True
        return False