2014年3月14日

LeetCode: Longest Substring Without Repeating Characters

摘要: 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.我 阅读全文

posted @ 2014-03-14 09:14 longhorn 阅读(119) 评论(0) 推荐(0) 编辑

导航