#3. Longest Substring Without Repeating Characters [Medium] [Javascript]

반응형

문제

Given a string s, find the length of the longest substring without repeating characters.

Example 1:

Input: s = "abcabcbb"
Output: 3
Explanation: The answer is "abc", with the length of 3.

Example 2:

Input: s = "bbbbb"
Output: 1
Explanation: The answer is "b", with the length of 1.

Example 3:

Input: s = "pwwkew"
Output: 3
Explanation: The answer is "wke", with the length of 3.
Notice that the answer must be a substring, "pwke" is a subsequence and not a substring.

Constraints:

• 0 <= s.length <= 5 * 104
• s consists of English letters, digits, symbols and spaces.

.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.

var lengthOfLongestSubstring = function(s) {
    const map = {};
    var left = 0;

    return s.split('').reduce((max, v, i) => {
        left = map[v] >= left ? map[v] + 1 : left;
        map[v] = i;
        return Math.max(max, i - left + 1);
    }, 0);
};

• 카카오스토리
• 트위터
• 페이스북

'개발 및 관련 자료 > LeetCode' 카테고리의 다른 글

#3. Longest Substring Without Repeating Characters [Medium] [Javascript]  (0)	2022.04.14
#2. Add Two Numbers [Medium][Javascript]  (0)	2022.04.03
#1. Two Sum [Easy] [javascript]  (0)	2022.03.31