Introduction - If you have any usage issues, please Google them yourself
For A and B are two strings. Operation to use at least the characters will be converted to string A string B. Operation of the characters mentioned here, including (1) delete a character (2) insert a character (3) will be replaced by one character to another character. Will transform the string A string B for at least the characters used in string operands as the editor of A to B distance is recorded as d (A, B). Test the design of an efficient algorithm, for any given two strings A and B, to calculate their edit distance d (A, B).