class Solution {
public List<Integer> findAnagrams(String s, String p) {
//异位词相当于排列,可以参考567.字符串的排列
//使用滑动窗口
Map<Character,Integer> need = new HashMap<>();
Map<Character,Integer> window = new HashMap<>();
//将p字符串映射到need map中
for ( int i = 0; i < p.length(); i ++){
char c = p.charAt(i);
need.put(c,need.getOrDefault(c,0)+1);
}
int left = 0, right = 0, valid = 0;
//new一个数组用来存放结果
List<Integer> res = new ArrayList<>();
while (right < s.length()){
char c = s.charAt(right);
right ++;
if(need.containsKey(c)){
window.put(c,window.getOrDefault(c,0)+1);
if(window.get(c).equals(need.get(c))){
valid++;
}
}
while (right - left >= p.length()){
//收缩
if(valid == need.size()){
res.add(left);//存放起始地址
}
char d = s.charAt(left);
left++;
if(need.containsKey(d)){
if (window.get(d).equals(need.get(d))){
valid--;
}
window.put(d,window.getOrDefault(d,0)-1);
}
}
}
return res;
}
}
class Solution {
public int lengthOfLongestSubstring(String s) {
//本题是滑动窗口解题,但是跟传统的有点区别
Map<Character,Integer> window = new HashMap<>();
int left = 0, right = 0,res = 0;
while(right < s.length()){
char c = s.charAt(right);
right++;
//对窗口内的数据进行操作
window.put(c,window.getOrDefault(c,0)+1);
//如何判断是否是重复的呢?
while(window.get(c)>1){
//说明重复,要收缩窗口
char d = s.charAt(left);
left ++;
window.put(d,window.getOrDefault(d,0)-1);
}
res = Math.max(res,right - left);
}
return res;
}
}