题目描述
给定两个字符串 s1 和 s2,写一个函数来判断 s2 是否包含 s1 的排列。
换句话说,第一个字符串的排列之一是第二个字符串的子串。
示例1:
输入: s1 = "ab" s2 = "eidbaooo"
输出: True
解释: s2 包含 s1 的排列之一 ("ba").
示例2:
输入: s1= "ab" s2 = "eidboaoo"
输出: False
Java代码
public boolean checkInclusion(String s1, String s2) {
int s1Length = s1.length();
int left = 0;
int right = 0;
HashMap<Character,Integer> window = new HashMap<>();
HashMap<Character,Integer> needs = new HashMap<>();
int valid = 0;
for (char c : s1.toCharArray()) {
needs.put(c,needs.getOrDefault(c, 0) + 1);
}
while (right < s2.length()) {
char c = s2.charAt(right);
right++;
if (needs.containsKey(c)) {
window.put(c,window.getOrDefault(c, 0) + 1);
if (window.get(c).equals(needs.get(c))) {
valid++;
}
}
while(right - left == s1Length) {
if (valid == needs.size()) {
return true;
}
char d = s2.charAt(left);
left++;
if (needs.containsKey(d)) {
if (window.get(d).equals(needs.get(d))) {
valid--;
}
window.put(d, window.getOrDefault(d, 0) - 1);
}
}
}
return false;
}
``