Fichas
Permutation in String(2 Strings)
Fichas del conjunto (1)
- 1Given two strings s1 and s2, write a function to return true if s2 contains the permutation of s1. In other words, one of the first string's permutations is the substring of the second string. Input:s1 = "ab" s2 = "eidbaooo" Output:True Explanation: s2 contains one permutation of s1 ("ba"). Input:s1= "ab" s2 = "eidboaoo" Output: Falsepublic class Solution {
public boolean checkInclusion(String s1, String s2) {
if(s1.length() > s2.length()) return false;
int len1 = s1.length();
int len2 = s2.length();
int count[] = new int[26];
for(int i = 0; i< len1; i++ ){
count[s2.charAt(i) - 'a']--;
count[s1.charAt(i) - 'a']++;
}
if( allZeros(count) ) return true;
for(int i = len1; i< len2; i++ ){
count[s2.charAt(i) - 'a']--;
count[s2.charAt(i - len1 ) - 'a']++;
if( allZeros(count) ) return true;
}
return false;
}
private boolean allZeros(int[] count){
for(int i = 0; i< 26; i++){
if(count[i] != 0 ) return false;
}
return true;
}
}
Información
- Descripción
- Fichas sobre Permutation in String(2 Strings), creado por Suhas S el 22/03/2018.
- Creado por
- Suhas S
- Visitas
- 0
- Valoración