用sliding window的方法，之前還有個k不同元素好像也是類似的思路。有時間可以去復習下。

https://leetcode.com/problems/longest-repeating-character-replacement/// sliding windowpublic class Solution {public int characterReplacement(String s, int k) {int[] count = new int[26];int maxch = -1; // the char with max count in current substrint max = 0; // the max count for single char in current substrint len = 0; // current substr lengthint ret = 0; // final resultfor (int i=0; i<s.length(); i++) {int tmp = s.charAt(i) - 'A';count[tmp]++;len++;if (maxch == tmp) {max++;}else {if (count[tmp] > max) {max = count[tmp];maxch = tmp;}}if (len - max <= k) {if (len > ret) {ret = len;}}while (len - max > k) {int newTmp = s.charAt(i-len+1) - 'A';count[newTmp]--;len--;if (maxch == newTmp) {max--;for (int j=0; j<26; j++) {if (count[j] > max) {max = count[j];maxch = j;}}}}}return ret;} }

?

總結

以上是生活随笔為你收集整理的longest-repeating-character-replacement(难)的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。