首页>itarticle>longest substring without repeating characters
longest substring without repeating characters
admin11月 11, 20200
题目
Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letters for "abcabcbb" is "abc", which the length is 3. For "bbbbb" the longest substring is "b", with the length of 1.
近期评论