Given 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.
Example 1:
Input:s1 = "ab" s2 = "eidbaooo" Output:True Explanation: s2 contains one permutation of s1 ("ba").
Example 2:
Input:s1= "ab" s2 = "eidboaoo" Output:
思路:permutation s1 是指对s1全排列里的一种情况,所以采用哈希的方法。维持两个长度为26的vector h1和h2, h1存放s1中每个字母出现的次数;定义一个长度为s1.length()的窗口,作用在s2上,h2存放s2在这个窗口中每个字母出现的次数。如果h1==h2,返回true;否则,窗口向后移动一位。
代码:
class Solution { public: bool checkInclusion(string s1, string s2) { if(s1.length()>s2.length()) return false; vector<int> h1(26,0); vector<int> h2(26,0); for (int i=0; i<s1.length(); i++) { h1[s1[i]-'a']++; h2[s2[i]-'a']++; } string::iterator p1=s2.begin(); string::iterator p2=s2.begin()+s1.length()-1; while(p2!=s2.end()) { if(h1==h2) return true; h2[*p1-'a']--; p1++; p2++; if (p2!=s2.end()) h2[*p2-'a']++; } return false; } };