2016年2月9日
[LeetCode] 159. Longest Substring with At Most Two Distinct Characters 最多有两个不同字符的最长子串
摘要： Given a string s , find the length of the longest substring t that contains at most 2 distinct characters. Example 1: Input: "eceba" Output: 3 Explana 阅读全文
posted @ 2016-02-09 15:20 Grandyang 阅读(20969) 评论(5) 推荐(1)
Fork me on GitHub