leetcode 2024. 考试的最大困扰度

2024. 考试的最大困扰度

法一：两次滑动窗口

class Solution {
public:
    int maxConsecutiveAnswers(string answerKey, int k) {
        int size = answerKey.size(),temp = k,res = 0,left,right;
        for(left = 0,right = 0;right < size;++right){//F -> T
            if(answerKey[right] == 'F')  --temp;
            if(temp < 0 && answerKey[right] == 'F'){
                res = max(res,right-left);
                while(answerKey[left] == 'T')  ++left;
                ++left;
                temp = 0;
            }
        }
        res = max(res,right-left);
        temp = k;
        for(left = 0,right = 0;right < size;++right){//T -> F
            if(answerKey[right] == 'T')  --temp;
            if(temp < 0 && answerKey[right] == 'T'){
                res = max(res,right-left);
                while(answerKey[left] == 'F')  ++left;
                ++left;
                temp = 0;
            }
        }
        return max(res,right-left);
    }
};

 法二：一次滑动窗口，窗口内保证F和T的数量有一种小于等于k即可，res就可以一直加

class Solution {
public:
    int maxConsecutiveAnswers(string answerKey, int k) {
        int size = answerKey.size(),res = 0,tCount = 0,fCount = 0;
        for(int left = 0,right = 0;right < size;++right){
            if(answerKey[right] == 'T')  ++tCount;
            else  ++fCount;//窗口内保证F和T的数量有一种小于等于k即可,res就可以一直加
            while(tCount > k && fCount > k){
                if(answerKey[left] == 'T')  --tCount;
                else  --fCount;
                ++left;
            }
            res = max(res,tCount+fCount);
        }
        return res;
    }
};