DFA有限状态自动机的.ppt

字符串模式匹配中DFA的应用;POJ1204 Word Puzzles;将问题抽象;思考…;确定性有限状态自动机DFA(deterministic finite automata) ;确定性有限状态自动机; 单词前缀树(trie);单词前缀树(trie);Trie树用途例子：如何求字符串的所有不同子串;单词前缀树(trie);前缀指针;如何高效的构造前缀指针;如何高效的构造前缀指针;如何在建立好的DFA上遍历;回到原问题;回到原问题;最纯粹的Trie图题目;#include iostream #include vector #include queue using namespace std; #define LETTERS 26 int nNodesCount = 0; struct CNode { CNode * pChilds[LETTERS]; CNode * pPrev; bool bStopNode; //是否是终止节点（危险节点） void Init() { memset(pChilds,0,sizeof(pChilds)); bStopNode = false; pPrev = NULL; } }; CNode Tree[200]; //10个模式串，每个10个字符，每个字符一个节点，也只要100个节点;void Insert( CNode * pRoot, char * s) { for( int i = 0; s[i]; i ++ ) { if( pRoot-pChilds[s[i]-a] == NULL) { pRoot-pChilds[s[i]-a] = Tree + nNodesCount; nNodesCount ++; } pRoot = pRoot-pChilds[s[i]-a]; } pRoot-bStopNode = true; };void BuildDfa( ) { for( int i = 0;i LETTERS ;i ++ ) Tree[0].pChilds[i] = Tree + 1; Tree[0].pPrev = NULL; Tree[1].pPrev = Tree; dequeCNode * q; q.push_back(Tree+1); while( ! q.empty() ){ CNode * pRoot = q.front(); q.pop_front();; for( int i = 0; i LETTERS ; i ++ ) { CNode * p = pRoot-pChilds[i]; if( p) { CNode * pPrev = pRoot-pPrev; while( pPrev ) { if( pPrev-pChilds[i] ) { p-pPrev = pPrev-pChilds[i]; if( p-pPrev-bStopNode ) p-bStopNode = true; //自己的pPrev指向的节点是危险节点，则自己也是危险节点 break; } else pPrev = pPrev-pPrev; } q.push_back(p); } } } //对应于while( ! q.empty() ) };bool SearchDfa(char * s) { CNode * p = Tree + 1; for( int i = 0; s[i] ;i ++ ) { while(true) { if( p-pChilds[s[i]-a]) { p = p-pChilds[s[i]-a]; if( p-bStopNode ) return true; break; } else p = p-pPrev; } } return false; };int main() { nNodesCount = 2; int M,N; scanf(%d%d,N,M); //N个模式串，M个句子 for( int i = 0;i N; i ++ ) { char s[20]; scanf(%s,s); Insert(Tree + 1,s); } BuildDfa(); for( int i = 0 ;i M;i ++ ) { char s[200]; scanf(%s,s); co