class Solution {
public boolean checkInclusion(String s1, String s2) {
if (s1.length() > s2.length()) return false;
int[] s1map = new int[26];
int[] s2map = new int[26];
for (int i = 0; i < s1.length(); i++) {
s1map[s1.charAt(i) - 'a']++;
s2map[s2.charAt(i) - 'a']++;
}
for (int i = s1.length(); i < s2.length(); i++) {
if (matches(s1map, s2map)) return true;
s2map[s2.charAt(i) - 'a']++;
s2map[s2.charAt(i - s1.length()) - 'a']--;
}
return matches(s1map, s2map);
}
private boolean matches(int[] s1map, int[] s2map) {
for (int i = 0; i < s1map.length; i++) {
if (s1map[i] != s2map[i]) return false;
}
return true;
}
}
leetcode567. 字符串的排列
最新推荐文章于 2024-06-27 18:47:05 发布