版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/csu_passer/article/details/89373889
思考图:
代码:
/**
* @param {string} s
* @return {number}
*/
var lengthOfLongestSubstring = function(s) {
let ret = 0;
let set = new Set();
let i = 0;
let j = 0;
let length = s.length;
while(i<length && j<length){
if(!set.has(s[j])){
set.add(s[j++])
ret = Math.max(ret, j-i)
}else{
set.delete(s[i++])
}
}
return ret;
};