3. Longest Substring Without Repeating Characters
Given a string, find the length of the longest substring without repeating characters.
Example 1:
Input: "abcabcbb"
Output: 3
Explanation: The answer is "abc", with the length of 3.
Example 2:
Input: "bbbbb"
Output: 1
Explanation: The answer is "b", with the length of 1.
Example 3:
Input: "pwwkew" Output: 3 Explanation: The answer is"wke", with the length of 3. Note that the answer must be a substring,"pwke"is a subsequence and not a substring.
题意：找出最长不重复字符子串，返回该子串长度
代码如下：
var lengthOfLongestSubstring = function(s) { var set=new Set(); var max=0; var len=s.length,i=0,j=0; while(i<len){ //如果没有重复，存入set if(!set.has(s.charAt(i))){ set.add(s.charAt(i++)); max=Math.max(max,set.size); }else{ //有重复，删除头一个再比较 set.delete(s.charAt(j++)) } } return max; };
3. Longest Substring Without Repeating Characters
原文：https://www.cnblogs.com/xingguozhiming/p/10372308.html