题意
思路
滑动窗口
代码
class Solution {
public:
int maxConsecutiveAnswers(string &answerKey, int k, char ch) {
int n = answerKey.size();
int ans = 0;
for (int l = 0, r = 0, sum = 0; r < n; r++) {
sum += answerKey[r] != ch;
while (sum > k)
sum -= answerKey[l++] != ch;
ans = max(ans, r - l + 1);
}
return ans;
}
int maxConsecutiveAnswers(string answerKey, int k) {
return max(maxConsecutiveAnswers(answerKey, k, 'T'), maxConsecutiveAnswers(answerKey, k, 'F'));
}
};
考试最大困扰度解法
336

被折叠的 条评论
为什么被折叠?



