딕셔너리1 LeetCode 3. Longest Substring Without Repeating Characters [Sliding Window, Two-Pointers] Problems: Given a string, find the length of the longest substring without repeating characters. Example 1: Input: "abcabcbb" Output: 3 Explanation: The answer is "abc", with the length of 3. Example 2: Input: "bbbbb" Output: 1 Explanation: The answer is "b", with the length of 1. Example 3: Input: "pwwkew" Output: 3 Explanation: The answer is "wke", with the length of 3. Note that the answer mu.. 2020. 6. 10. 이전 1 다음
