Algorithm --> 字符串中最长不重合子串长度

#include <iostream>
using namespace std;

int getMaxLen(const string &s)
{
    int beg = 0;
    int span = 0;
    int maxspan = 0;
    int hashTable[128];
    for (int i = 0; i < 128; ++i)
        hashTable[i] = 0;
    int lens = s.size();
    for(int i = 0; i < lens; ++i)
    {
        int index = s[i];
        if (hashTable[index] == 1)
        {
            span = i - beg;
            if (span > maxspan)
                maxspan = span;
            beg++;
        }
        else
        {
            hashTable[s[i]] = 1;
        }
    }
    return maxspan;
}

int main()
{
    const string a = "abmadsefadd";
    const string a1 = "avoaid";
    cout << getMaxLen(a) << endl;
    cout << getMaxLen(a1) << endl;
}

7
3