JavaScript-Data-Structures-and-Alo/LongestSubstring.html at master · cqA7/JavaScript-Data-Structures-and-Alo · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
<!DOCTYPE html>
<html lang="en">
<head>
    <meta charset="UTF-8">
    <title>最长不重复子串</title>
</head>
<body>
<script>
    /**
     * @param {string} s
     * @return {number}
     */
    let lengthOfLongestSubstring = function (s) {
        let res = 0; // 用于存放当前最长无重复子串的长度
        let str = ""; // 用于存放无重复子串
        let len = s.length;
        for (let i = 0; i < len; i++) {
            let char = s.charAt(i);
            let index = str.indexOf(char);
            if (index === -1) {
                str += char;
                res = res < str.length ? str.length : res;
            } else {
                str = str.substr(index + 1) + char;//如果存在一个重复的字符，则这个字符第一次出现的位置前的字符都舍弃(可以保证)
            }
        }
        return res;
    };

    console.log(lengthOfLongestSubstring("abdevbac"));
</script>
</body>
</html>