From aad1bf85861f5c0bc7c7ef99077080350d439ae0 Mon Sep 17 00:00:00 2001 From: zzu <90972641+Zuhye@users.noreply.github.com> Date: Fri, 13 Nov 2026 23:43:42 +0900 Subject: [PATCH] 1638. Count Substrings That Differ by One Character --- ...Count Substrings That Differ by One Character" | 15 +++++++++++++++ 1 file changed, 15 insertions(+) create mode 100644 "leetcode3/\354\206\241\354\243\274\355\230\234/1638. Count Substrings That Differ by One Character" diff --git "a/leetcode3/\354\206\241\354\243\274\355\230\234/1638. Count Substrings That Differ by One Character" "b/leetcode3/\354\206\241\354\243\274\355\230\234/1638. Count Substrings That Differ by One Character" new file mode 100644 index 00000000..8cacf60e --- /dev/null +++ "b/leetcode3/\354\206\241\354\243\274\355\230\234/1638. Count Substrings That Differ by One Character" @@ -0,0 +1,15 @@ +class Solution: + def countSubstrings(self, s: str, t: str) -> int: + result = 0 + for i in range(len(s)): + for j in range(len(t)): + gap = 0 + for k in range(min(len(s)-i, len(t)-j)): + if s[i+k] != t[j+k]: + gap += 1 + + if gap == 1: + result += 1 + else: + break + return result