字符串的编辑距离也被称为Levenshtein距离（Levenshtein Distance），一般用动态规划来实现。属于经典算法。-Edit distance of the string is also known as the Levenshtein distance (Distance Levenshtein), the general use of dynamic programming to achieve. Belong to the classical algorithm.