2016年4月22日
159. Longest Substring with At Most Two Distinct Characters
摘要： Given a string, find the length of the longest substring T that contains at most 2 distinct characters. For example, Given s = “eceba”, T is "ece" whi 阅读全文
posted @ 2016-04-22 12:50 Joyce-Lee 阅读(217) 评论(0) 推荐(0) 编辑
3. Longest Substring Without Repeating Characters
摘要： Given a string, find the length of the longest substring without repeating characters. Examples: Given "abcabcbb", the answer is "abc", which the leng 阅读全文
posted @ 2016-04-22 09:18 Joyce-Lee 阅读(180) 评论(0) 推荐(0) 编辑