1
class Solution {
2
 public:
3
  bool checkInclusion(string s1, string s2) {
4
    sort(s1.begin(), s1.end());
5
    int n = s1.size(), m = s2.size();
6
    for (int i = 0; i <= m - n; i++) {
7
      string s = s2.substr(i, n);
8
      sort(s.begin(), s.end());
9
      if (s1 == s) return true;
10
    }
11
    return false;
12
  }
13
};