Description: Let A and B is the same length of two strings. A and B is defined as the distance between the corresponding location and distance characters. Two non-space character, the distance between them is the ASCII of absolute poor. And the blank spaces in the range of 0; Space with other characters to a certain distance from the k value. A string of expansion is inserted in A certain space character from the string. In the A and B string in all the same length of the extension, a minimum distance of the expansion, The distance from the string as A and B from the expansion. For a given string, A and B, test design an algorithm to calculate the distance of expansion.
To Search:
File list (Check if you may need any files):
Download