LeetCode 459. Repeated Substring Pattern

标签：false   pat   代码   blog   letter   tput   reg   nbsp   tin   

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

 1 public class Solution {
 2     public boolean repeatedSubstringPattern(String str) {
 3         if(str == null || str.length() < 2) return false;
 4         
 5         boolean result = false;
 6         for(int i = 1; i <= str.length()/2; i++) {
 7             if(str.length()%i != 0) continue;
 8             String regex = "("+str.substring(0,i)+")" + "+";
 9             result = result | str.matches(regex);
10         }
11         return result;
12     }
13 }

LeetCode 459. Repeated Substring Pattern

标签：false   pat   代码   blog   letter   tput   reg   nbsp   tin   

原文地址：http://www.cnblogs.com/liujinhong/p/6071653.html