package com.bingoabin.algorithm.slipwindow;
/**
* @Author: xubin34
* @Date: 2022/3/29 9:45 上午
* @CopyRight: sankuai.com
* @Description:
*/
public class MaxConsecutiveAnswers {
//Leetcode 2024. 考试的最大困扰度
//示例:输入:answerKey = "TTFF", k = 2
// 输出:4
// 解释:我们可以将两个 'F' 都变为 'T' ,得到 answerKey = "TT