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

    本题我开始想到了把字符串/2,然后让左面和右面进行比较,但是发现ababab这种的就没有办法解决了,看了答案,发现解决思路比较像,只不过把其最大公约数全部都比较一次,代码如下:
     1 public class Solution {
     2     public boolean repeatedSubstringPattern(String str) {
     3         int len = str.length();
     4         for(int i=len/2;i>=1;i--){
     5             if(len%i==0){
     6                 int p = len/i;
     7                 String sub = str.substring(0,i);
     8                 int k;
     9                 for(k=0;k<p;k++){
    10                     if(!sub.equals(str.substring(k*i,k*i+i))) break;
    11                 }
    12                 if(k==p) return true;
    13             }
    14         }
    15         return false;
    16     }
    17 }

     这道题的特点是,对于有很多重复的子字符串。

  • 相关阅读:
    poj 3074(DLX)
    zoj 3209(DLX)
    hdu 4531(模拟+BFS+DFS)
    hdu 2065(递推+矩阵优化)
    poj 3714 (最近点对)
    zoj 3690(递推+矩阵优化)
    poj 3076(DLX)
    hdu 4533(一种很巧妙的方法|线段树+扫描线)
    hdu 4513(模拟)
    sql server 2008 评估已过期。
  • 原文地址:https://www.cnblogs.com/codeskiller/p/6388648.html
Copyright © 2011-2022 走看看