class Solution(object):
def isOneEditDistance(self, word1, word2):
l1=len(word1)
l2=len(word2)
if l1>l2:
return self.isOneEditDistance(word2,word1)
if l2-l1>1:
return False
i=0
while i<l1 and word1[i]==word2[i]:
i+=1
if l1==l2:
return word1[i+1:]==word2[i+1:]
else:
return word1[i:]==word2[i+1:]
161. One Edit Distance
最后编辑于 :
©著作权归作者所有,转载或内容合作请联系作者
- 文/潘晓璐 我一进店门,熙熙楼的掌柜王于贵愁眉苦脸地迎上来,“玉大人,你说我怎么就摊上这事。” “怎么了?”我有些...
- 文/花漫 我一把揭开白布。 她就那样静静地躺着,像睡着了一般。 火红的嫁衣衬着肌肤如雪。 梳的纹丝不乱的头发上,一...
- 文/苍兰香墨 我猛地睁开眼,长吁一口气:“原来是场噩梦啊……” “哼!你这毒妇竟也来了?” 一声冷哼从身侧响起,我...
推荐阅读更多精彩内容
- Given two strings S and T, determine if they are both one...
- Given two strings S and T, determine if they are both one...
- Given two strings S and T, determine if they are both one...
- Given two strings S and T, determine if they are both one...