# origin: Programming+ exercise edit-distance # status: unverified; `corpus.py verify` checks it on the pinned compiler # probe: the fewest single-letter edits (substitute, insert, delete) that turn a into b # expect-stdout: 3 def edit_distance(a: String, b: String) -> Int: var n = a.count_codepoints() var m = b.count_codepoints() var d = List[List[Int]]() for _ in range(n + 1): var row = List[Int]() for _ in range(m + 1): row.append(0) d.append(row^) for i in range(n + 1): d[i][0] = i for j in range(m + 1): d[0][j] = j for i in range(1, n + 1): for j in range(1, m + 1): var cost = 1 if a[codepoint=i - 1] == b[codepoint=j - 1]: cost = 0 d[i][j] = min( d[i - 1][j] + 1, d[i][j - 1] + 1, d[i - 1][j - 1] + cost ) return d[n][m] def main(): print(edit_distance("GATTACA", "GCATGCA"))