Lintcode 640. One Edit Distance (Medium) (Python)

最新推荐文章于 2019-03-27 17:50:07 发布

2Young2Simple

最新推荐文章于 2019-03-27 17:50:07 发布

阅读量161

点赞数

分类专栏： Lintcode刷题文章标签： Lintcode Python

本文链接：https://blog.csdn.net/weixin_41677877/article/details/81570112

版权

Lintcode刷题专栏收录该内容

82 篇文章 0 订阅

订阅专栏

One Edit Distance

Description:

Given two strings S and T, determine if they are both one edit distance apart.

Example
Given s = “aDb”, t = “adb”
return true

Code:

class Solution:
    """
    @param s: a string
    @param t: a string
    @return: true if they are both one edit distance apart or false
    """
    def isOneEditDistance(self, s, t):
        # write your code here
        ls = len(s)
        lt = len(t)
        if abs(ls-lt)>1:
            return False
        elif abs(ls-lt)==1:
            if ls>lt:
                ls, lt = lt, ls
                s[:], t[:] = t[:], s[:]
            for i in range(lt):
                if t[0:i]+t[i+1:]==s[:]:
                    return True
            return False
        elif ls==lt:
            cnt = 0
            for i in range(ls):
                if s[i]!=t[i]:
                    cnt+=1
                if cnt>1:
                    return False
            return True