题目解析
代码如下

题目解析

这一题是一道会员的题目，题目介绍如下：

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 its length is 3.

意思的大概情况是找出一个字符串中不相同字符不超过两个的最长子串

根据我们之前介绍的滑动窗口法的解法:
滑动窗口法详解
leetcode 438. Find All Anagrams in a String 滑动窗口法
leetcode 3. Longest Substring Without Repeating Characters 最长非重复子串的长度滑动窗口法

此题与leetcode第三题，相似非常高，可以先做第三题再做这一题：

代码如下

from collections import defaultdictclass Solution:def lengthOfLongestSubstringTwoDistinct(self, s):begin, end, counter, length = 0, 0, 0, 0map_dict = defaultdict(int)while end < len(s):c = s[end]map_dict[c] += 1# counter 表示新的字符if map_dict == 1:counter += 1end += 1# 如果新字符的数量大于2,就开始移动窗口while counter > 2:char_tmp = s[begin]if map_dict[char_tmp] == 1:counter -= 1map_dict[char_tmp] -= 1begin += 1length = max(length, end - begin)return length

leetcode Longest Substring with At Most Two Distinct Characters 滑动窗口法相关推荐

[LeetCode] 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 char ...
[LeetCode] 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 characte ...
LeetCode 159. Longest Substring with At Most Two Distinct Characters --Java,C++,Python解法
题目地址:Longest Substring with At Most Two Distinct Characters - LeetCode Given a string s , find the l ...
LeetCode 340. Longest Substring with At Most K Distinct Characters
原题链接在这里:https://leetcode.com/problems/longest-substring-with-at-most-k-distinct-characters/ 题目: Give ...
[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 char ...
Longest Substring With At Most K Distinct Characters
Given a string, find the length of the longest substring T that contains at most k distinct characte ...
LeetCode Longest Substring with At Least K Repeating Characters(递归)
问题:给出一个字符串s,要求求出最长的子串,每个字符出现至少k次思路: 方法一,先统计每个字符出现的次数,然后分别从头和尾找出出现资料最小为k的位置,然后再此区间遍历,当出现小于k次时,在两个子区间 ...
【算法】159题 Longest Substring with at Most Two Distinct Characters 最大的子串
1.概述给定一个字符串.查找一个最长子序列,这个子序列中重复的字符最多包含2个. 此问题和 [算法]剑指 Offer 48. 最长不含重复字符的子字符串问题很相似. 2.方案 2.1 双指针 pu ...
386 · Longest Substring with At Most K Distinct Characters最多有k个不同字符的最长子字符串
链接:https://www.lintcode.com/problem/386/description https://mp.weixin.qq.com/s?__biz=MzU2OTUyNzk1NQ= ...

leetcode Longest Substring with At Most Two Distinct Characters 滑动窗口法

题目解析

代码如下

leetcode Longest Substring with At Most Two Distinct Characters 滑动窗口法相关推荐

最新文章

热门文章