algorithm
algorithm copied to clipboard
3. 无重复字符的最长子串

/**
* @param {string} s
* @return {number}
*/
var lengthOfLongestSubstring = function(s) {
let arr = s.split('');
let max = 0;
let temp = [];
for(let i=0,j=0;j<arr.length;){
if(arr[j] != undefined && !temp.includes(arr[j])){
temp.push(arr[j])
j++
}else{
i++
temp = arr.slice(i,j);
}
max = max > temp.length ? max : temp.length;
}
return max;
};