Press "Enter" to skip to content

Repeated Substring Pattern-LeetCode#459

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.)
public class RepeatedSubstringPattern {
    public boolean repeatedSubstringPattern(String s) {
        int l = s.length();
        for (int i = l / 2; i >= 1; i--) {
            if (l % i == 0) {
                String temp = s.substring(0, i);
                StringBuilder stringBuilder = new StringBuilder();
                for (int j = 0; j < l / i; j++) {
                if (stringBuilder.toString().equals(s)) return true;

        return false;

Be First to Comment


电子邮件地址不会被公开。 必填项已用*标注