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; } }
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】凌霞软件回馈社区,博客园 & 1Panel & Halo 联合会员上线
【推荐】抖音旗下AI助手豆包,你的智能百科全书,全免费不限次数
【推荐】博客园社区专享云产品让利特惠,阿里云新客6.5折上折
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步