Python Easy and Clean Solution

  • 0
    class Solution(object):
        def isOneEditDistance(self, s, t):
            :type s: str
            :type t: str
            :rtype: bool
            n1, n2 = len(s), len(t)
            def check(i):
                if i == n1: return i==n2-1
                if i == n2: return i==n1-1
                if s[i] == t[i]: return check(i+1)
                if n1  == n2: return s[i+1:] == t[i+1:]
                if n1 < n2: return s[i:] == t[i+1:]
                return s[i+1:] == t[i:]
            return check(0)

Log in to reply

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.