comefrom: <doocs>1638.Count Substrings That Differ by One Character_1.py
code: def countSubstrings( s: str, t: str) -> int:
      m, n = len(s), len(t)
      ans = 0
      for i in range(m):
          for j in range(n):
              if s[i] != t[j]:
                  l = r = 1
                  while i - l >= 0 and j - l >= 0 and s[i - l] == t[j - l]:
                      l += 1
                  while i + r < m and j + r < n and s[i + r] == t[j + r]:
                      r += 1
                  ans += l * r
      return ans
masked: def sample_funcname ( var_0 : str , var_1 : str ) -> int :
      var_2 , var_3 = len ( var_0 ) , len ( var_1 )
      var_4 = 0
      for var_5 in range ( var_2 ) :
          for var_6 in range ( var_3 ) :
              if var_0 [ var_5 ] != var_1 [ var_6 ] :
                  var_8 = var_7 = 1
                  while var_5 - var_8 >= 0 and var_6 - var_8 >= 0 and var_0 [ var_5 - var_8 ] == var_1 [ var_6 - var_8 ] :
                      var_8 += 1
                  while var_5 + var_7 < var_2 and var_6 + var_7 < var_3 and var_0 [ var_5 + var_7 ] == var_1 [ var_6 + var_7 ] :
                      var_7 += 1
                  var_4 += var_8 * var_7
      return var_4
  