class Solution:
def minDistance(self, a: str, b: str) -> int:
t = []
for i in range(len(a) + 1):
l = []
for j in range(len(b) + 1):
l.append(0)
t.append(l)
for i in range(1, len(a) +1, 1):
for j in range(1, len(b) + 1, 1):
if a[i-1] == b[j-1]:
t[i][j] = 1 + t[i-1][j-1]
else:
t[i][j] = max(t[i][j-1], t[i-1][j])
return len(a) + len(b) - (t[len(a)][len(b)] * 2)
1220B - Multiplication Table | 1644A - Doors and Keys |
1644B - Anti-Fibonacci Permutation | 1610A - Anti Light's Cell Guessing |
349B - Color the Fence | 144A - Arrival of the General |
1106A - Lunar New Year and Cross Counting | 58A - Chat room |
230A - Dragons | 200B - Drinks |
13A - Numbers | 129A - Cookies |
1367B - Even Array | 136A - Presents |
1450A - Avoid Trygub | 327A - Flipping Game |
411A - Password Check | 1520C - Not Adjacent Matrix |
1538B - Friends and Candies | 580A - Kefa and First Steps |
1038B - Non-Coprime Partition | 43A - Football |
50A - Domino piling | 479A - Expression |
1480A - Yet Another String Game | 1216C - White Sheet |
1648A - Weird Sum | 427A - Police Recruits |
535A - Tavas and Nafas | 581A - Vasya the Hipster |