LeetCode Python - 3. Longest Substring Without Repeating Characters
1.Descriptions
Given a string, find the length of the longest substring without repeating characters.
Examples:
Given "abcabcbb", the answer is "abc",
which the length is 3.
Given "bbb
原创
2018-02-07 11:53:25 ·
170 阅读 ·
0 评论