leetcode-3 无重复字符的最长子串

  /**
   * @param {string} s
   * @return {number}
   */
  var lengthOfLongestSubstring = function (s) {
    // 滑动窗口
    let maxLen = 0,
      map = new Map();
    for (let left = 0, right = 0; right < s.length; ++right) {
      if (map.has(s[right])) {
        left = Math.max(map.get(s[right]) + 1, left);
      }
      map.set(s[right], right);
      maxLen = Math.max(maxLen, right - left + 1);
    }
    return maxLen;
  };
console.log(lengthOfLongestSubstring('abcabcbb'))