3 - 无重复字符的最长子串 about leetcode HOT 1 OPEN

const lengthOfLongestSubstring = (s: string): number => {
  const set = new Set<string>();
  let max = 0;
  let t = 0;
  let i = 0;
  while (i < s.length) {
    const char = s[i];
    if (set.has(char)) {
      while (s[t] !== char) {
        set.delete(s[t]);
        t++;
      }
      t++;
    } else {
      set.add(char);
    }
    set.size > max ? (max = set.size) : max;
    i++;
  }
  return max;
};

console.log(lengthOfLongestSubstring("abcabcbb")); // 3
console.log(lengthOfLongestSubstring("aabaab!bb")); // 3
console.log(lengthOfLongestSubstring("pwwkew")); // 3
console.log(lengthOfLongestSubstring(" ")); // 1