← 返回 bytedance 的题目列表Longest Substring Without Repeating Characters
类型：online_judge
Given a string s, return the length of the longest substring that contains no repeated characters.
Input: one line string s.
Output: one integer, the length of the longest substring without repeating characters.
Constraints:
0 <= len(s) <= 2 * 10^5
Examples:
Input: abcabcbb
Output: 3
Input: bbbbb
Output: 1
Input: pwwkew
Output: 3
Example
Input
abcabcbb
Output
3