반응형
Longest Substring Without Repeating Characters 풀이
-
[Algorithm] LeetCode - 3. Longest Substring Without Repeating Characters (Hash Table, String, Sliding Window)Alogorithm 2022. 7. 28. 00:14
LeetCode 문제입니다. [문제설명] Given a string s, find the length of the longest substring without repeating characters. 번역) Given a string s, find the length of the longest substring without repeating characters. 주어는 문자열 s에서, 반복되지 않은 문자가 없는 가장 긴 문자열의 길이를 구하시오 Topic: Hash Table, String, Sliding Window Level: Medium Accepted 3,608,442 / Submissions 10,756,223 [제한사항] 0 subStr === [...new Set(subStr.split("..