Advertisement
Egor_1425

Untitled

May 3rd, 2024
25
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
Python 0.46 KB | None | 0 0
  1. a = list(input())
  2. b = list(input())
  3. dp = [[0] * (len(a)+1) for x in range(len(b)+1)]
  4. for i in range(len(b)+1):
  5.     dp[i][0] = i
  6. for j in range(len(a)+1):
  7.     dp[0][j] = j
  8.  
  9. for i in range(1, len(b)+1):
  10.         for j in range(1, len(a)+1):
  11.             dp[i][j] = min(dp[i-1][j], dp[i][j-1]) + 1
  12.             dp[i][j] = min(dp[i][j], dp[i-1][j-1] + (a[j-1] != b[i-1]))
  13.             if b[i-1] == a[j-1]:
  14.                 dp[i][j] = dp[i-1][j-1]
  15.  
  16. print(dp[-1][-1])
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement