[LeetCode] 159. Longest Substring with At Most Two Distinct Characters 最多有兩個不同字符的最長子串
們一個字符串，讓求最多有兩個不同字符的最長子串。那么首先想到的是用 HashMap 來做，HashMap ...
原文：[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 two distinct characters.For example,Given S eceba ,T is ece which its length is . 給一個字符串，找出最多有兩個不同字符的最長子串。還是滑動窗口法，定義一 ...
2018-03-08 07:41 0 1221 推薦指數：
相關推薦
[LeetCode] 340. Longest Substring with At Most K Distinct Characters 最多有K個不同字符的最長子串
Given a string, find the length of the longest substring T that contains at most k distinct characters. Example 1: Example ...
最長子串（Leetcode-3 Longest Substring Without Repeating Characters）
Question: Given a string, find the length of the longest substring without repeating characters. Examples: Given "abcabcbb", the answer is "abc ...
[LeetCode] 3. Longest Substring Without Repeating Characters 最長無重復字符的子串
Given a string, find the length of the longest substring without repeating characters. Example 1: Example ...
[LeetCode] 395. Longest Substring with At Least K Repeating Characters 至少有K個重復字符的最長子字符串
Find the length of the longest substring T of a given string (consists of lowercase letters only) such that every character in T appears no less than ...
[LeetCode] 395. Longest Substring with At Least K Repeating Characters 至少有K個重復字符的最長子字符串
Find the length of the longest substring T of a given string (consists of lowercase letters only) such that every character in T appears no less ...
[Leetcode] Longest palindromic substring 最長回文子串
longest palindromic substring. 做這道題之前要先了解什么是回文子串。回文串通俗的 ...
LeetCode:Longest Palindromic Substring 最長回文子串
longest palindromic substring. 求字符串的最長回文子串 算法 ...