[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
Explanation: tis “ece” which its length is 3.
Example 2:

Input: “ccaabbb”
Output: 5
Explanation: tis “aabbb” which its length is 5.

def longestsubstring(s):
	l=0
	j=0
	dic={}
	for j in range(len(s)):
		dic[s[j]]=dic.get(s[j],0)+1
		while len(dic.keys())>2:
			dic[s[l]]-=1
			if dic[s[l]]==0:
				dic.remove(s[l])
			l+=1
		ret=max(ret,j-l+1)
	return ret

• 点赞
• 收藏
• 分享
• • 文章举报

标签：159,Explanation,Two,ret,dic,Substring,length,Input,tis
来源： https://blog.csdn.net/huntershuai/article/details/104171532