leetcode之 Longest Substring Without Repeating Characters
problem:
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 “bbbbb”, the answer is
原创
2017-08-04 16:02:53 ·
300 阅读 ·
0 评论