字符串的长度_求给定字符串最大不重复子串长度

题目描述：

题目介绍

#include <iostream>
#include <string>

using namespace std;

unsigned int getMaxLengthOfUnrepeatSubstr(string &s, int len);

int main(int argc, char* argv[]) {
    string s = "ababcdeabci";

    unsigned int max_sub_len = getMaxLengthOfUnrepeatSubstr(s, s.length());
    cout << "max length of unrepeat substring is: " << max_sub_len << endl;

    return 0;
}

unsigned int getMaxLengthOfUnrepeatSubstr(string &s, int len) {
    int i, j;
    unsigned int max_len = 1;
    cout << "input: " << s << "ninput length is: " << len << endl;

    // 异常输入判断
    if (s.empty() || len <= 0)
        return 0;
    
    if (len == 1)
        return 1;

    // 一个辅助hash表，标记字符是否出现过
    int visited[256];

    for (i = 0; i < len; i++)
    {
        memset(visited, 0x0, sizeof(int[256]));
        visited[s[i]] = 1;
    
        for (j = i+1; j < len; j++)
        {
            // 出现过
            if (visited[s[j]] == 1) { 
                max_len = max_len > (j -i) ? max_len:(j-i);
                break;
            } else { // 未出现过
                visited[s[j]] = 1;
            }
        }
        if (j == len)
            max_len = max_len > (j -i) ? max_len:(j-i);
    }
    
    return max_len;
}