摘要: 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 @ 2020-07-31 23:22 苗妙苗 阅读(123) 评论(0) 推荐(0) 编辑
摘要: Given a string, find the length of the longest substring without repeating characters. Example 1: Input: "abcabcbb" Output: 3 Explanation: The answer 阅读全文
posted @ 2020-07-31 11:19 苗妙苗 阅读(131) 评论(0) 推荐(0) 编辑