Introduction - If you have any usage issues, please Google them yourself
Two strings, A and B, from A to B, can be achieved by adding, deletion and modification of letters, each of which increase, delete and modify a letter into one step, this program can be obtained by the dynamic programming method to calculate the minimum number of steps of string edit