项目闲了些了,继续搞起来。
Given a string, find the length of the longest substring without repeating characters.
var lengthOfLongestSubstring = function(s) {
if (s.length == 0) return 0;
var max = 0;
var obj = {};
for (var i=0, j=0; i < s.length; i++){
if (obj[s.charAt(i)] !== undefined){
j = Math.max(j, obj[s.charAt(i)] + 1);
}
obj[s.charAt(i)] = i;
max = Math.max(max,i-j+1);
}
return max;
};