动态规划——编辑距离问题 设A和B是2个字符串。要用最少的字符操作将字符串A转换为字符串B。-Dynamic Programming- edit distance problem Let A and B are two strings. Characters use the least action string A converted to a string B.