leetcode第三题无重复字符的最长子串

var lengthOfLongestSubstring = function (s) {
    let arr = [];
    let max = 0;
    for (let i = 0; i < s.length; i++) {
        for (let j = i; j < s.length; j++) {
            if (!arr.includes(s[j])) {
                arr.push(s[j])
            } else {
                max = arr.length > max ? arr.length : max;
                arr = [];
                break;
            }
        }
    }
    return s.length == 1 ? 1 : max;
};