leetcode

0 class Solution {

1 public:

2 int countSubstrings(const string &s, const string &t) {

3 int res = 0;

4 for (int i = 0; i < s.size(); ++i) {

5 for (int j = 0; j < t.size(); ++j) {

6 for (int pos = 0, miss = 0; i + pos < s.size() && j + pos < t.size(); ++pos) {

7 if (s[i + pos] != t[j + pos] && ++miss > 1) break;

8 res += miss;

9 }

10 }

11 }

12 return res;

13 }

14 };