zoukankan      html  css  js  c++  java
  • 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.)

    class Solution:
        def repeatedSubstringPattern(self, s):
            """
            :type s: str
            :rtype: bool
            """
            def judge(i):
                pos = i + i
                while pos<=len(s):
                    if s[pos-i:pos]!=s[:i]:
                        return False
                    pos += i
                return True
            for i in range(1,len(s)):
                if len(s)%i!=0:
                    continue
                if judge(i):
                    return True
            return False
    
  • 相关阅读:
    封装

    如何通过命令行窗口查看sqlite数据库文件
    标签控件
    信息提示框
    循环
    数组
    switch
    成员局部变量
    变量
  • 原文地址:https://www.cnblogs.com/bernieloveslife/p/9775259.html
Copyright © 2011-2022 走看看