1.替换最多k字符,找到最长的xxx字符串
问题描述:
有一个01字符串,有之多k次将0替换成1的机会,求最长的全1子串
输入:k=2 s=’1001010101’
输出:5 (即‘10101’变为‘11111’)
方法1:
本质思想就是:不定长滑动窗口法,但是要保证窗口内0的个数是相同的
def deal(s,k):
change = 0
left = 0
right = 0
res = 1
n = len(s)
for i in range(n):
if s[i] == '0':
if change < k:
change += 1
right += 1
else:
while left <= right and s[left] != '0':
left += 1
# 程序走到这里时s[left] = 1, s[right=i] = 0,
# 意思是放弃前一个替换,让当前点s[right=i]获得这次替换机会,本质就是保证窗口内0个数不变
left += 1
right += 1
else:
right += 1
res = max(res, right-left)
return res
方法2:
参考:https://blog.csdn.net/u013554860/article/details/80417958
class Solution {
public:
int characterReplacement(string s, int k) {
int res = 0, maxCnt = 0, start = 0;//maxCnt字符出现次数最多数
vector<int> counts(26, 0);
for(int i=0; i<s.size(); i++){
maxCnt = max(maxCnt, ++counts[s[i]-'A']);
while ((i-start+1)-maxCnt>k) {
counts[s[start]-'A'] -=1;
start +=1;
}
res = max(res, i-start+1); // i-start+1的最大子字符串长度。
}
return res;
}
};