← 返回 microsoft 的题目列表Sliding Window String/Array Problem (NeetCode 150 style)
类型：online_judge
Problem: Sliding Window
Given an ASCII string s, return the length of the longest substring without repeating characters.
Input
One line: string s
Output
Print one integer: the maximum length
Constraints
0 <= len(s) <= 2 * 10^5
s contains visible ASCII characters
Examples
Input:
abcabcbb
Output:
3
Example
Input
abcabcbb
Output
3