2019年1月22日
340. Longest Substring with At Most K Distinct Characters - Hard
摘要： Given a string, find the length of the longest substring T that contains at most k distinct characters. Example 1: Input: s = "eceba", k = 2 Output: 3 阅读全文
posted @ 2019-01-22 10:30 fatttcat 阅读(165) 评论(0) 推荐(0) 编辑
159. Longest Substring with At Most Two Distinct Characters - Hard
摘要： Given a string s , find the length of the longest substring t that contains at most 2 distinct characters. Example 1: Example 2: 和 3. Longest Substrin 阅读全文
posted @ 2019-01-22 10:24 fatttcat 阅读(161) 评论(0) 推荐(0) 编辑
438. Find All Anagrams in a String - Easy
摘要： Given a string s and a non-empty string p, find all the start indices of p's anagrams in s. Strings consists of lowercase English letters only and the 阅读全文
posted @ 2019-01-22 09:50 fatttcat 阅读(135) 评论(0) 推荐(0) 编辑
3. Longest Substring Without Repeating Characters - Medium
摘要： Given a string, find the length of the longest substring without repeating characters. Example 1: Input: "abcabcbb" Output: 3 Explanation: The answer 阅读全文
posted @ 2019-01-22 09:11 fatttcat 阅读(127) 评论(0) 推荐(0) 编辑