题目:
Given a string that consists of only uppercase English letters, you can replace any letter in the string with another letter at most k times. Find the length of a longest substring containing all repeating letters you can get after performing the above operations.
Note:
Both the string's length and k will not exceed 104.
Example 1:
Input: s = "ABAB", k = 2 Output: 4 Explanation: Replace the two 'A's with two 'B's or vice versa.
Example 2:
Input: s = "AABABBA", k = 1 Output: 4 Explanation: Replace the one 'A' in the middle with 'B' and form "AABBBBA". The substring "BBBB" has the longest repeating letters, which is 4.
题意:
给定全部由大写字母组成的字符串和数字k,可将字符串中的字母用其他字母替换k次,求替换后,字符串中含有相同字母的最长子串长度
代码:
public class Solution {
public int characterReplacement(String s, int k) {
int n = s.length();
if ( n == 0 ) {
return 0;
}
int map[];
map = new int[26]; #将字母映射到map中,key:字母-‘A’ value:字母在字符串中出现的次数
map[s.charAt(0)-'A']++; #统计字符串s中的第一个字母出现次数
int most = map[s.charAt(0)-'A']; #most:记录字符串s中出现次数最多的字母,初始化为s[0]出现的次数
int res = 1; #替换后最长子串长度
int left = 0; #定义窗口,left:窗口左侧
for( int right = 1 ; right < n; right++) { #right:窗口右侧
map[s.charAt(right)-'A']++; #统计右移的窗口对应的字母的出现次数,放在map中
most = Math.max(most, map[s.charAt(right)-'A']); #修改most值,判断原有窗口出现次数最多的字母,与新进窗口的字母出现次数比较,most取大的那个
if( right - left + 1 > most+k ) { #如果窗口大于出现次数最多的字母出现次数与k的和,则需要修改窗口
map[s.charAt(left)-'A']--; #移除窗口的字母出现次数减一
left++; #窗口左侧右移
} else {
res = Math.max(res, right-left+1); #保持窗口>当前最大值res的情况下,我们才看是否满足others <= k,满足才更新
}
}
return res;
}
}
笔记:
java:
1、统计字符串长度:int n = s.length();
2、定义数组: int map[]; 或 int [] map;
3、数组初始化:map = new int[26];
4、获取字符串对应下标的char 值:s.charAt(0)
5、计算最大值函数:Math.max()
6、输出函数: System.out.print("aaaaaa");
代码算法参考:http://www.cnblogs.com/reboot329/p/5968393.html