3. 无重复字符的最长子串

[zpc7]

3. 无重复字符的最长子串

function lengthOfLongestSubstring(s: string): number {
    if (s === '') return 0;

    const strArr = s.split('');
    const stack = [];

    for (let i = 0; i < strArr.length; i++) {
        if (i === 0) {
            stack.push(strArr[i]);
            continue;
        }
        const index = stack[i - 1].indexOf(strArr[i]);
        if (index === -1) {
            stack.push(stack[i - 1] + strArr[i])
        } else {
            stack.push(stack[i - 1].slice(index + 1) + strArr[i])
        }

    }
    return Math.max(...stack.map(i => i.length))
};