Searching for Patterns の Set 1 (Naive Pattern Searching)
Given a text txt[0..n-1] and a pattern pat[0..m-1], write a function search(char pat[], char txt[]) that prints all occurrences of pat[] in txt[]. You may assume that n > m.Examples:
1) Input: txt[] =
原创
2017-05-02 22:31:39 ·
205 阅读 ·
0 评论