首页 > 其他 > 详细

You're Given a String...

时间:2017-12-03 19:35:36      阅读:263      评论:0      收藏:0      [点我收藏+]

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.

Example
Input
abcd
Output
0
Input
ababa
Output
3
Input
zzz
Output
2
找重复出现至少一次的最大子串长度
代码:
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <algorithm>
#include <map>
#define Max 1001
using namespace std;
char s[101];


int main()
{
    cin>>s;
    int d = 0;
    for(int i = 0;i < strlen(s) - 1;i ++)
    {
        for(int j = i + 1;j < strlen(s);j ++)
        {
            int cnt = 0;
            while(j + cnt <strlen(s)&&s[i + cnt] == s[j + cnt])cnt ++;
            if(d < cnt)d = cnt;
        }
    }
    cout<<d<<endl;
}

 

You're Given a String...

原文:http://www.cnblogs.com/8023spz/p/7966827.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!