js无重复字符串最长子串

  /* 
    eg: abcabcbb---3
  */
 var lengthOfLongestSubstring=function(s){
   const set =new Set();
   let i=0;j=0;maxLength=0;
   if(s.length===0){
    return 0
   }
   for(i;is.length;i++){
    if(!set.has(s[i])){//没有重复的情况
      set.add(s[i])
      maxLength = Math.max(maxLength,set.size)
    }else{//重复情况
      while(set.has(s[i])){
        set.delete(s[i]);
        j++
      }
      set.add(s[i])
    }  
   }
   return maxLength
 }

标签：子串,set,return,++,length,js,add,maxLength,字符串
来源： https://www.cnblogs.com/lht1132950411/p/16380359.html