Day 7 A. You‘re Given a String...

Problem：
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.

Examples

input
abcd
output
0

input
ababa
output
3

input
zzz
output
2

题目意思：获取出现两次字母的最长子串长度。
没啥意思 上代码

#include<iostream>
#include<set>
using namespace std;
int main()
{
    string s;
    cin >> s;
    set<string> ss;
    for (int i = s.size(); i >= 1; i--)
    {
        ss.clear();
        for (int j = 0; j + i <= s.size(); j++)
        {
            ss.insert(s.substr(j, i));
        }
        if (ss.size() != s.size() - i + 1)
        //这里的判断方法是用如果之前取的set字符是否不等于从从前往后取到 s.size() - i + 1的字符串
        //如果不等于说明已经出现了两次字母的最长子串 输出长度
        //因为set具有不会重复的特性 
        {
            cout << i << endl;
            return 0;
        }
    }
    cout << 0 << endl;
    return 0;
}