2015年1月25日

Longest Substring with At Most Two Distinct

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

posted @ 2015-01-25 03:27 Step-BY-Step 阅读(195) 评论(0) 推荐(0) 编辑

导航