[Algo] Anagram Substring Search 变形词子串 - SegmentFault

[Algo] Anagram Substring Search 变形词子串 - SegmentFault

Anagram Substring Search

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[] and its permutations (or anagrams) in txt[]. You may assume that n > m.

Read full article from [Algo] Anagram Substring Search 变形词子串 - SegmentFault