250x250
반응형
Notice
Recent Posts
Recent Comments
Link
목록substring (1)
N
(Leet Code c++)Longest Substring Without Repeating Characters
3. Longest Substring Without Repeating Characters 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 i..
Leet Code 알고리즘
2021. 7. 1. 10:02