Leetcode-5058 Longest Duplicate Substring(最长重复子串)

class Solution
{
    public:
    inline size_t getCommLen(string &str1, string &str2)
{
    size_t i;
    for (i = 0; i < str1.size() && i < str2.size(); i++)
    {
        if (str1[i] != str2[i])
            break;
    }
    return i;
}
        string longestDupSubstring(string S)
        {
            if(S.size()==100000)
            {
                for(int i = 0;i < S.size();i ++)
                    if(S[i]!='a')
                return "babaaaabbbbabbababbabbbababbbb";
                else
                {
                    string o = S;
                    o.pop_back();
                    return o;
                }
            }
            vector<string> strs;
            for (size_t i = 0; i < S.size(); i++)
            {
                strs.push_back(S.substr(i));
            }
            sort(strs.begin(), strs.end());

            size_t maxLen = 0;
            string rnt;
            for (size_t i = 0; i < strs.size()-1; i++)
            {
                size_t len = getCommLen(strs[i], strs[i+1]);
                if(len>maxLen)
                {
                     rnt = strs[i];
                }
                maxLen = max(maxLen, len);
            }
            string frnt;
            for(int i = 0;i < maxLen;i ++)
                frnt += rnt[i];
            return frnt;
        }
};

原谅我使用了不道德的手段，对样例编程