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.

stringcmp.cpp
stringcmp.pdf
stringcmp.ppt

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．