one edit distance python

determine if two strings are in one edit distance


there are two cases we need to consider:

1.they are in the same length but one char different

2. they have exactly one char different with one length different



code is as follow.

def editone(str1,str2):
	m=len(str1)
	n=len(str2)
	
	if m>n:
		return editone(str2,str1)
	##make sure len(str2)>len(str1)
	if n-m>1:# if the dif is greater than 1 then false
		return False
	
	shift=n-m## see the dif
	i=0

	while i<m and  str1[i]==str2[i]:
		i+=1
	if i==m:
		return shift>0## if m==n and they are all the same return false
	
	if shift==0:## otheriwse check they are only one char dif
		i+=1
	while i<m and str1[i]==str2[i+shift]:
		i+=1
	return i==m
print editone('a','b')



评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值