题目描述
给定一个字符串,只包含大写字母,求在包含同一字母的子串中,长度第 k 长的子串的长度,相同字母只取最长的那个子串。
代码实现
python
# coding:utf-8
# 第K长的连续字母字符串长度
# https://www.nowcoder.com/discuss/353150502185672704?sourceSSR=search
class Solution:
def maxContinuousStr(self, s):
res = dict()
count = 1
for i in range(len(s) - 1):
if s[i] == s[i + 1]:
count += 1
else:
if s[i] in res:
res[s[i]] = max(res[s[i]], count)
else:
res[s[i]] = count
count = 1
ret = sorted(res.items(), key=(lambda x: x[1]), reverse=True)
return ret[k-1][1]
if __name__ == '__main__':
s = input("input S:").split(' ')[0]
k = int(input('input K :').split(' ')[0])
solution = Solution()
print(solution.maxContinuousStr(s))