字符串的排列
题意:
**给定两个字符串 s1 和 s2,写一个函数来判断 s2 是否包含 s1 的排列。
换句话说,第一个字符串的排列之一是第二个字符串的子串。
示例1:
输入: s1 = “ab” s2 = “eidbaooo”
输出: True
解释: s2 包含 s1 的排列之一 (“ba”).
示例2:
输入: s1= “ab” s2 = “eidboaoo”
输出: False
注意:
输入的字符串只包含小写字母
两个字符串的长度都在 [1, 10,000] 之间
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/permutation-in-string
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。**
分析思路:
这道题和leetcode438题差不多这里就不作过多的解释如果不懂可以查看leetcode438题
代码
/**
* Input: s1 = "ab" s2 = "eidbaooo"
* Output: True
* Explanation: s2 contains one permutation of s1 ("ba").
* Runtime: 3 ms, faster than 99.42% of Java online submissions for Permutation in String.
* Memory Usage: 37.9 MB, less than 57.69% of Java online submissions for Permutation in String.
* Next challenges:
* @param s1
* @param s2
* @return
*/
public boolean checkInclusion(String s1, String s2) {
if (s1.length()>s2.length() || s2==null) return false;
if (s1==null || s1.length()==0) return true;
char[] chars = s1.toCharArray();
char[] chars1 = s2.toCharArray();
int[] map=new int[256];
for (int i = 0; i < chars.length; i++) {
map[chars[i]]++;
}
int left=0,right=0,match=s1.length(),len=s2.length();
int aimlen=s1.length();
while (right!=len){
map[chars1[right]]--;
if (map[chars1[right]]>=0){
match--;
}
if (match==0){
return true;
}
if (right>=aimlen-1){
map[chars1[left]]++;
if (map[chars1[left]]>0){
match++;
}
left++;
}
right++;
}
return false;
}