KMP algorithm can reduce the use of string pattern matching complete retrospective, so the algorithm whenever the character appears in a visit the matching process more unequal, i do not need to back a pointer, but the use has been matched to a " partial match" results will be right-slip model as far a distance to compare

KMP.doc

• 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．