Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- a = 'kociol'
- b = 'kot'
- def dystans(a,b):
- n, m = len(a), len(b)
- if n > m:
- a,b = b,a
- n,m = m,n
- obecny = range(n+1)
- for i in range(1,m+1):
- nastepny, obecny = obecny, [i]+[0]*m
- for j in range(1,n+1):
- dodaj, usun = nastepny[j]+1, obecny[j-1]+1
- zmien = nastepny[j-1]
- if a[j-1] != b[i-1]:
- zmien = zmien + 1
- obecny[j] = min(dodaj, usun, zmien)
- return obecny[n]
- print (dystans(a,b))
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement