第一次使用博客园

1.第一次使用

Hellow word

2. 公式

\(2^{mn}\)

3. 程序

def longest_substring_with_k_distinct(str1, k):
	start = 0
	freq_map = {}
	maxlength = 0
	for end in range(len(str1)):
		value = str1[end]
		if value not in freq_map:
			freq_map[value] = 0
		freq_map[value] += 1

		while len(freq_map)>k:
			temp = str1[start]
			freq_map[temp] -= 1
			if freq_map[temp] == 0:
				del freq_map[temp]
			start += 1
		maxlength = max(maxlength, end-start+1)
	return maxlength

if __name__ == '__main__':
	string = "cbbebi"
	k = 3
	length = longest_substring_with_k_distinct(string, 3)
	print(length)