0. 滑动窗口的模板
public int slideWindow(String s,String p){//在s中找p的子串
//1.range 表示字符串中字符ASCII中所处的范围,以小写字母为例,range为26
int[] needs = new int[range];//记录子串p的字符个数
int[] windows = new int[range];//记录窗口中字符的个数
//2.记录p串字符
int cntChar = 0;//记录不同的字符个数
for (int i = 0; i < p.length(); i++) {
int index = p.charAt(i) - 'a';
needs[index]++;
if(needs[index] == 1) cntChar++;//如果该字母第一次出现,记录下来
}
//3.移动窗口的左右端
int left = 0,right = 0;//[left,right) 左取右不取
int valid = 0;//有效字符个数
while (right < s.length()){
//窗口的扩展与更新
...
//窗口的收缩与更新
...
}
return ans;//返回结果
}
1) LeetCode 3.无重复字符的最长子串
代码:
public static int LengthOfLongestSubString(String s){
if(s == null || s.length() == 0) return 0;
// int[] needs = new int[26];//本题相当于needs全为1
int[] window = new int[256];//窗口中包含的各个字符的个数
int cntChar = 0;//有效字符个数(就是说,有多少个各异的字母)
//开始窗口滑动
int left = 0,right = 0;//[left,right)
int valid = 0,maxLen = 0;//记录窗口中有效字符个数
int index;
while (right < s.length()){
while(right < s.length()){//右端扩展
index = s.charAt(right);
right++;
window[index]++;
if(window[index] == 1){//当该字符在窗口中只出现一次时
valid++;
}else break;//当某个字符第二次出现gg
}
if(valid > maxLen)//由于题意要求连续无重复子串,所以不同字符个数也就是子串长度
maxLen = valid;
while (left < right){//左端点右移,把重复的字符移除窗口为止,至于为什么是right-1,因为右端点取不到
index = s.charAt(left);
left++;
window[index]--;
if(window[index]==0){
valid--;
}else if (window[index] == 1){//减去一个还剩一个,说明这个字符就是right-1对应的重复的字符
break;
}
}
}
return maxLen;
}
2)567.最小区间
public static boolean checkInclusion(String s1, String s2) {
if(s1 == null || s2 == null || s2.length() < s1.length()) return false;
int[] needs = new int[26];//s1串中各个字母的个数,根据题意,只要小写字母
int[] window = new int[26];//窗口中包含的各个字母的个数
int cntChar = 0;//有效字母个数(就是说,有多少个各异的字母)
for (int i = 0;i < s1.length();i++){//记录s1串的字符
int index = s1.charAt(i) - 'a';
needs[index]++;
if(needs[index] == 1) cntChar++;//如果该字母第一次出现,记录下来
}
//开始窗口滑动
int left = 0,right = 0;//[left,right)
int valid = 0;//记录窗口中有效字母个数
int index;
while (right < s2.length()){
while(right < s2.length() && right-left < s1.length()){//右端扩展
index = s2.charAt(right)-'a';
right++;
window[index]++;
if(window[index] == needs[index]){//当index字母个数相同,valid+1
valid++;
}
}
if(valid == cntChar && right-left == s1.length())
return true;
if(right < s2.length()){//左边压缩,每次左端右移一个字符,那么需要保证右移之后,右端还能右移,否则s1肯定匹配不上s2了,因为s1都已经比s2还短了,直接break或者return false 完事
index = s2.charAt(left)-'a';
left++;
window[index]--;
if(window[index] == needs[index]-1){
valid--;
}
}else break;
}
return false;
}
3)438.找到字符串中所有字母异位词
/**
* 在第564题基础上改改就行
*/
public static List<Integer> findAnagrams(String s,String p){
if(p == null || s == null || s.length() < p.length()) return new ArrayList<>();
int[] needs = new int[26];//p串中各个字母的个数,根据题意,只要小写字母
int[] window = new int[26];//窗口中包含的各个字母的个数
int cntChar = 0;//有效字母个数(就是说,有多少个各异的字母)
for (int i = 0;i < p.length();i++){//记录p串的字符
int index = p.charAt(i) - 'a';
needs[index]++;
if(needs[index] == 1) cntChar++;//如果该字母第一次出现,记录下来
}
//开始窗口滑动
int left = 0,right = 0;//[left,right)
int valid = 0;//记录窗口中有效字母个数
int index;
List<Integer> list = new ArrayList<>();
while (right < s.length()){
while(right < s.length() && right-left < p.length()){//右端扩展
index = s.charAt(right)-'a';
right++;
window[index]++;
if(window[index] == needs[index]){//当index字母个数相同,valid+1
valid++;
}
}
if(valid == cntChar && right-left == p.length())
list.add(left);
if(right < s.length()){//左边压缩,每次左端右移一个字符,那么需要保证右移之后,右端还能右移,否则p肯定匹配不上s了,因为p都已经比s还短了,直接break或者return false 完事
index = s.charAt(left)-'a';
left++;
window[index]--;
if(window[index] == needs[index]-1){
valid--;
}
}else break;
}
return list;
}
4)76.最小覆盖子串
public static String minWindow(String s,String t){
if(s == null || t == null || s.length() < t.length()) return "";
int[] needs = new int[58];//用来记录t串中各个字母的个数,'z'-'A'=57
int[] window = new int[58];//用来记录窗口中各个字母的个数
//记录t串中各个字母的个数
int cntChar = 0;
for (int i = 0; i < t.length(); i++) {
int mark = t.charAt(i)-'A';
if (needs[mark] == 0) cntChar++;
needs[mark]++;
}
//开始窗口滑动
int start = 0,len = Integer.MAX_VALUE;//记录最短子串的开始下标和长度
int left = 0,right = 0;//窗口双指针,左取右不取 [left,right)
int valid = 0;//记录有效字母个数
char ch;
while (right < s.length()){
while (right < s.length() && valid != cntChar) {//向右扩展窗口
ch = s.charAt(right);
right++;
window[ch - 'A']++;//记录字符
if (window[ch - 'A'] == needs[ch - 'A']) {//当窗口中字符ch的个数和t串中ch字符相同,则有效字母个数+1
valid++;
}
}
while (left < right && valid == cntChar){//左端开始向右压缩窗口
//不断更新最短匹配子串
if (right - left < len){//因为[left,right)
len = right - left;
start = left;
}
//压缩
ch = s.charAt(left);
left++;
if (needs[ch - 'A'] == window[ch - 'A']){//当窗口中字符ch个数等于t串中ch字符个数,有效字母个数-1
valid--;
}
window[ch-'A']--;//然后ch个数再-1
}
}
return len == Integer.MAX_VALUE ? "" : s.substring(start,start+len);
}