문자열 s가 주어지면 중복 문자가 없는 부분 문자열의 가장 긴 길이를 찾습니다

Example 1:  예 1:

Input: s = "abcabcbb"
Output: 3
Explanation: The answer is "abc", with the length of 3.

Example 2:  예 2:

Input: s = "bbbbb"
Output: 1
Explanation: The answer is "b", with the length of 1.

Example 3:  예 3:

Input: s = "pwwkew"
Output: 3
Explanation: The answer is "wke", with the length of 3.
Notice that the answer must be a substring, "pwke" is a subsequence and not a substring.

Constraints:  제약 조건:

• 0 <= s.length <= 5 * 104

• s consists of English letters, digits, symbols and spaces.

  s는 영문자, 숫자, 기호 및 공백으로 구성됩니다.