KMP algorithm extension worker Kaka

Source: Internet
Author: User
Objective: To read a string of any length and find the position where all substrings of the specified length appear.
Requirements: time and space complexity Optimization
Algorithm: The KMP algorithm is used for comparison. Of course, there are many unexpected problems ....
Implementation language: C ++ (hybrid C perspiration)
Testimonial: I am too lazy to write for a long time .......
Perception: whether to use a text processing language such as Perl or Ruby for processing is more advantageous. I hope someone can write a version like this.
Code ProgramAs follows:
/Files/painmoth/mystringcmp.rar
Welcome to debug and improvement. There are few comments in addition. Sorry.

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.