You're Given a String...

最新推荐文章于 2024-05-11 10:00:00 发布

原创最新推荐文章于 2024-05-11 10:00:00 发布 · 902 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

2013寒假集训专栏收录该内容

15 篇文章

订阅专栏

本文介绍了一个简单但容易出错的算法实现，用于寻找给定字符串中最长的重复子串。通过实例演示如何避免数组开辟过小的问题，并提供了一段C++代码作为参考。

1、点击打开链接

2、题目大意：给定一个字符串，求重复出现的子串的最大长度

题目很简单，但是错了好几次，最后才发现数组开小了

3、题目：

You're given a string of lower-case Latin letters. Your task is to find the length of its longest substring that can be met in the string at least twice. These occurrences can overlap (see sample test 2).

Input

The first input line contains the string. It's guaranteed, that the string is non-empty, consists of lower-case Latin letters, and its length doesn't exceed 100.

Output

Output one number — length of the longest substring that can be met in the string at least twice.

Sample test(s)

Input

abcd

Output

Input

ababa

Output

Input

zzz

Output

3、代码：

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int cmp(int a,int b)
{
    return a>b;
}
char str[110];
int sum[11000];//错在数组开小了
int main()
{
    scanf("%s",str);
    //memset(sum,-1,sizeof(sum));
    int n=strlen(str);
    int k=0;
    for(int i=0;i<n;i++)
    {
        for(int j=i+1;j<n;j++)
        {
            int ii=i;
            int jj=j;
            while(str[ii]==str[jj])
            {
                sum[k]++;
                ii++;
                jj++;
            }
            if(str[i]==str[j])
            k++;
        }
    }
    sort(sum,sum+k,cmp);
    printf("%d\n",sum[0]);
    return 0;
}
/*
iegdlraaidefgegiagrdfhihe

*/