首页 > 代码库 > 459. Repeated Substring Pattern
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 Solution { public boolean repeatedSubstringPattern(String str) { if(str == null || str.length() == 0) return true; for(int i = str.length()/2 ; i >= 1 ; i--){ if(str.length() % i == 0){ int m = str.length()/i; String repeatP = str.substring(0,i); int j = 0; for(; j < m ; j++){ if(!repeatP.equals(str.substring(i*j, i+j*i))) break; } if(j == m) return true; } } return false; } }
459. Repeated Substring Pattern
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。