161. One Edit Distance

最新推荐文章于 2020-03-21 17:25:41 发布

niunc

最新推荐文章于 2020-03-21 17:25:41 发布

阅读量69

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/niunc/article/details/82469074

版权

LeetCode 专栏收录该内容

185 篇文章

订阅专栏

https://leetcode.com/problems/one-edit-distance/description/

Given two strings s and t, determine if they are both one edit distance apart.

Note:

There are 3 possiblities to satisify one edit distance apart:

Insert a character into s to get t
Delete a character from s to get t
Replace a character of s to get t

Example 1:

Input: s = "ab", t = "acb"
Output: true
Explanation: We can insert 'c' into s to get t.

Example 2:

Input: s = "cab", t = "ad"
Output: false
Explanation: We cannot get t from s by only one step.

Example 3:

Input: s = "1203", t = "1213"
Output: true
Explanation: We can replace '0' with '1' to get t.

class Solution(object):
    def isOneEditDistance(self, s, t):
        """
        :type s: str
        :type t: str
        :rtype: bool
        """
        def judge(s1, s2):
            length = len(s2)
            isChange = False
            i, j = 0, 0
            while j < length:
                if s1[i] == s2[j]:
                    i += 1
                    j += 1
                elif not isChange:
                    i += 1
                    isChange = True
                else:
                    return False
            return True
        
        isChange = False
        len_s = len(s)
        len_t = len(t)
        
        if len_s - len_t > 1 or len_t - len_s > 1:
            return False
        if len_s == len_t:
            for i in range(len_s):
                if s[i] != t[i] and not isChange:
                    isChange = True
                elif s[i] != t[i]:
                    return False
            return isChange
        elif len_s > len_t and len_t > 0:
            return judge(s, t)
        elif len_t > len_s and len_s > 0:
            return judge(t, s)
        return True