本题解思路参考labuladong的算法题解
class Solution {
public String minWindow(String s, String t) {
//window 和 need为两个计数器
HashMap <Character,Integer> window = new HashMap<Character,Integer>();
HashMap <Character,Integer> need = new HashMap<Character,Integer>();
for(char c : t.toCharArray())need.put(c,need.getOrDefault(c,0)+1);
int left=0,right=0,valid = 0;//滑动窗口的左右
int start=0,len = Integer.MAX_VALUE;
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(valid == need.size()){
if(right -left <len){
start =left;
len = right -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 len == Integer.MAX_VALUE ? "" : s.substring(start,start+len);
}
}