Open king-lxt opened 3 years ago
var lengthOfLongestSubstring = function (s) {
let strArr = [], maxLength = 0;
for (let i = 0; i < s.length; i++) {
let index = strArr.indexOf(s[i]);
if (index != -1) {
// 删除当前元素
strArr.splice(0, index + 1);
}
strArr.push(s[i]);
maxLength = Math.max(maxLength, strArr.length);
}
return maxLength;
};
输入: "abcabcbb" 输出: 3 解释: 因为无重复字符的最长子串是 "abc",所以其长度为 3
示例 2:
输入: "bbbbb" 输出: 1 解释: 因为无重复字符的最长子串是 "b",所以其长度为 1。