力扣2379.得到k个黑块的最少涂色次数 i为右端点 class Solution { public: int minimumRecolors(string blocks, int k) { int w=0; for(int i=0;i<k;i++) { if(blocks[i] == 'W') w++; } int res = w; for(int i=k;i<blocks.size();i++) { w += (blocks[i] == 'W') - (blocks[i-k] == 'W'); res = min(res,w); } return res; } };