This minimum number of changes is called the edit distance.
最小数量的更改称为编辑距离。
In fact, a Levenshtein distance is also known as an edit distance.
实际上，Levenshtein距离也称作编辑距离。
Design an algorithm to calculate any two of the string edit distance.
设计一个算法，计算任意两个字符串的编辑距离。
Design an algorithm to calculate any two of the string edit distance.
设计一个算法，计算任意两个字符串的编辑距离。
应用推荐