{"id":1791,"date":"2017-02-18T08:32:16","date_gmt":"2017-02-18T00:32:16","guid":{"rendered":"http:\/\/cn.hostease.com\/xueyuan\/?p=1791"},"modified":"2025-01-13T18:43:11","modified_gmt":"2025-01-13T10:43:11","slug":"%e7%bb%8f%e5%85%b8%e7%ae%97%e6%b3%95%e9%a2%98%e6%af%8f%e6%97%a5%e6%bc%94%e7%bb%83-%e7%ac%ac%e5%85%ab%e9%a2%98-ac%e8%87%aa%e5%8a%a8%e6%9c%ba","status":"publish","type":"post","link":"https:\/\/cn.hostease.com\/xueyuan\/jishu\/%e7%bb%8f%e5%85%b8%e7%ae%97%e6%b3%95%e9%a2%98%e6%af%8f%e6%97%a5%e6%bc%94%e7%bb%83-%e7%ac%ac%e5%85%ab%e9%a2%98-ac%e8%87%aa%e5%8a%a8%e6%9c%ba\/","title":{"rendered":"\u7ecf\u5178\u7b97\u6cd5\u9898\u6bcf\u65e5\u6f14\u7ec3\u2014\u2014\u7b2c\u516b\u9898 AC\u81ea\u52a8\u673a"},"content":{"rendered":"\n

\u4e0a\u4e00\u7bc7\u6211\u4eec\u8bf4\u4e86\u5355\u6a21\u5f0f\u5339\u914d\u7b97\u6cd5KMP\uff0c\u73b0\u5728\u6211\u4eec\u6709\u9700\u6c42\u4e86\uff0c\u6211\u8981\u68c0\u67e5\u4e00\u7bc7\u6587\u7ae0\u4e2d\u662f\u5426\u6709\u67d0\u4e9b\u654f\u611f\u8bcd\uff0c\u8fd9\u5176\u5b9e\u5c31\u662f\u591a\u6a21\u5f0f\u5339\u914d\u7684\u95ee\u9898\u3002<\/p>\n\n\n\n

\u5f53\u7136\u4f60\u4e5f\u53ef\u4ee5\u7528KMP\u7b97\u6cd5\u6c42\u51fa\uff0c\u90a3\u4e48\u5b83\u7684\u65f6\u95f4\u590d\u6742\u5ea6\u4e3aO(c*(m+n))\uff0cc\uff1a\u4e3a\u6a21\u5f0f\u4e32\u7684\u4e2a\u6570\u3002m\uff1a\u4e3a\u6a21\u5f0f\u4e32\u7684\u957f\u5ea6,n:\u4e3a\u6b63\u6587\u7684\u957f\u5ea6\uff0c\u90a3<\/p>\n\n\n\n

\u4e48\u8fd9\u4e2a\u590d\u6742\u5ea6\u5c31\u4e0d\u518d\u662f\u7ebf\u6027\u4e86\uff0c\u6211\u4eec\u5b66\u7b97\u6cd5\u5c31\u662f\u5e0c\u671b\u80fd\u628a\u8981\u89e3\u51b3\u7684\u95ee\u9898\u4f18\u5316\u5230\u6781\u81f4\uff0c\u8fd9\u4e0d\uff0cAC\u81ea\u52a8\u673a\u5c31\u6d3e\u4e0a\u7528\u573a\u4e86\u3002<\/p>\n\n\n\n

\u5176\u5b9eAC\u81ea\u52a8\u673a\u5c31\u662fTrie\u6811\u7684\u4e00\u4e2a\u6d3b\u7528\uff0c\u6d3b\u7528\u70b9\u5c31\u662f\u704c\u8f93\u4e86kmp\u7684\u601d\u60f3\uff0c\u4ece\u800c\u518d\u6b21\u628a\u65f6\u95f4\u590d\u6742\u5ea6\u4f18\u5316\u5230\u7ebf\u6027\u7684O(N)\uff0c\u521a\u597d\u6211\u524d\u9762\u7684\u6587<\/p>\n\n\n\n

\u7ae0\u5df2\u7ecf\u8bf4\u8fc7\u4e86Trie\u6811\u548cKMP\uff0c\u8fd9\u91cc\u8fd8\u662f\u9ed8\u8ba4\u5927\u5bb6\u90fd\u61c2\u3002<\/p>\n\n\n\n

\u4e00\uff1a\u6784\u5efaAC\u81ea\u52a8\u673a<\/p>\n\n\n\n

\u540c\u6837\u6211\u4e5f\u7528\u7f51\u4e0a\u7684\u7ecf\u5178\u4f8b\u5b50\uff0c\u73b0\u6709say she shr he her \u8fd9\u68375\u4e2a\u6a21\u5f0f\u4e32\uff0c\u4e3b\u4e32\u4e3ayasherhs\uff0c\u6211\u8981\u505a\u7684\u5c31\u662f\u54ea\u4e9b\u6a21\u5f0f\u4e32\u5728\u4e3b\u4e32\u4e2d\u51fa\u73b0\u8fc7\uff1f<\/p>\n\n\n\n

1: \u6784\u5efatrie\u6811<\/p>\n\n\n\n

\u5982\u679c\u770b\u8fc7\u6211\u524d\u9762\u7684\u6587\u7ae0\uff0c\u6784\u5efatrie\u6811\u8fd8\u662f\u5f88\u5bb9\u6613\u7684\u3002<\/p>\n\n\n\n

\"\"<\/a><\/figure>\n\n\n\n

<\/p>\n\n\n\n

2\uff1a\u5931\u8d25\u6307\u9488<\/p>\n\n\n\n

\u6784\u5efa\u5931\u8d25\u6307\u9488\u662fAC\u81ea\u52a8\u673a\u7684\u6838\u5fc3\u6240\u5728\uff0c\u73a9\u8f6c\u4e86\u5b83\u4e5f\u5c31\u73a9\u8f6c\u4e86AC\u81ea\u52a8\u673a\uff0c\u5931\u8d25\u6307\u9488\u975e\u5e38\u7c7b\u4f3c\u4e8eKMP\u4e2d\u7684next\u6570\u7ec4\uff0c\u4e5f\u5c31\u662f\u8bf4\uff0c<\/p>\n\n\n\n

\u5f53\u6211\u7684\u4e3b\u4e32\u5728trie\u6811\u4e2d\u8fdb\u884c\u5339\u914d\u7684\u65f6\u5019\uff0c\u5982\u679c\u5f53\u524d\u8282\u70b9\u4e0d\u80fd\u518d\u7ee7\u7eed\u8fdb\u884c\u5339\u914d\uff0c\u90a3\u4e48\u6211\u4eec\u5c31\u4f1a\u8d70\u5230\u5f53\u524d\u8282\u70b9\u7684failNode\u8282\u70b9\u7ee7\u7eed\u8fdb\u884c<\/p>\n\n\n\n

\u5339\u914d\uff0c\u6784\u5efafailnode\u8282\u70b9\u4e5f\u662f\u5f88\u6d41\u7a0b\u5316\u7684\u3002<\/p>\n\n\n\n

\u2460\uff1aroot\u8282\u70b9\u7684\u5b50\u8282\u70b9\u7684failnode\u90fd\u662f\u6307\u5411root\u3002<\/p>\n\n\n\n

\u2461\uff1a\u5f53\u8d70\u5230\u5728\u201cshe\u201d\u4e2d\u7684\u201dh\u201c\u8282\u70b9\u65f6\uff0c\u6211\u4eec\u7ed9\u5b83\u7684failnode\u8bbe\u7f6e\u4ec0\u4e48\u5462\uff1f\u6b64\u65f6\u5c31\u8981\u8d70\u8be5\u8282\u70b9\uff08h)\u7684\u7236\u8282\u70b9(s)\u7684\u5931\u8d25\u6307\u9488\uff0c\u4e00\u76f4\u56de\u6eaf\u76f4<\/p>\n\n\n\n

\u5230\u627e\u5230\u67d0\u4e2a\u8282\u70b9\u7684\u5b69\u5b50\u8282\u70b9\u4e5f\u662f\u5f53\u521d\u8282\u70b9\u540c\u6837\u7684\u5b57\u7b26(h)\uff0c\u6ca1\u6709\u627e\u5230\u7684\u8bdd\uff0c\u5176\u5931\u8d25\u6307\u9488\u5c31\u6307\u5411root\u3002<\/p>\n\n\n\n

\u6bd4\u5982\uff1ah\u8282\u70b9\u7684\u7236\u8282\u70b9\u4e3as\uff0cs\u7684failnode\u8282\u70b9\u4e3aroot\uff0c\u8d70\u5230root\u540e\u7ee7\u7eed\u5bfb\u627e\u5b50\u8282\u70b9\u4e3ah\u7684\u8282\u70b9\uff0c\u6070\u597d\u6211\u4eec\u627e\u5230\u4e86\uff0c\uff08\u5047\u5982\u8fd8\u662f\u6ca1<\/p>\n\n\n\n

\u6709\u627e\u5230\uff0c\u5219\u7ee7\u7eed\u8d70\u8be5\u8282\u70b9\u7684failnode\uff0c\u563f\u563f\uff0c\u662f\u4e0d\u662f\u5f88\u50cf\u4e00\u79cd\u56de\u6eaf\u67e5\u627e\uff09\uff0c\u6b64\u65f6\u5c31\u5c06 \u201dshe”\u4e2d\u7684\u201ch\u201d\u8282\u70b9\u7684fainode”\u6307\u5411<\/p>\n\n\n\n

“her”\u4e2d\u7684\u201ch\u201d\u8282\u70b9\uff0c\u597d\uff0c\u539f\u7406\u5176\u5b9e\u5c31\u662f\u8fd9\u6837\u3002\uff08\u770b\u770b\u4f60\u7684\u60f3\u6cd5\u662f\u4e0d\u662f\u8ddf\u56fe\u4e00\u6837\uff09<\/p>\n\n\n\n

\"\"<\/a><\/figure>\n\n\n\n

<\/p>\n\n\n\n

\u9488\u5bf9\u56fe\u4e2d\u7ea2\u7ebf\u7684\u201dh\uff0ce\u201c\u8fd9\u4e24\u4e2a\u8282\u70b9\uff0c\u6211\u4eec\u60f3\u8d77\u4e86\u4ec0\u4e48\u5462\uff1f\u5bf9\u201dher\u201c\u4e2d\u7684\u201de\u201c\u6765\u8bf4\uff0ce\u5230root\u8ddd\u79bb\u7684n\u4e2a\u5b57\u7b26\u6070\u597d\u4e0e\u201dshe\u201c\u4e2d\u7684e\u5411\u4e0a\u7684n<\/p>\n\n\n\n

\u4e2a\u5b57\u7b26\u76f8\u7b49\uff0c\u6211\u4e5f\u975e\u5e38\u7c7b\u4f3c\u4e8ekmp\u4e2dnext\u51fd\u6570\uff0c\u5f53\u5b57\u7b26\u5931\u914d\u65f6\uff0cnext\u6570\u7ec4\u4e2d\u8bb0\u5f55\u7740\u4e0b\u4e00\u6b21\u5339\u914d\u65f6\u6a21\u5f0f\u4e32\u7684\u8d77\u59cb\u4f4d\u7f6e\u3002<\/p>\n\n\n\n

\n
<\/a><\/figure>
<\/span><\/div>\n
 1 #region Trie\u6811\u8282\u70b9\n 2         \/\/\/ <summary>\n 3         \/\/\/ Trie\u6811\u8282\u70b9\n 4         \/\/\/ <\/summary>\n 5         public class TrieNode\n 6         {\n 7             \/\/\/ <summary>\n 8             \/\/\/ 26\u4e2a\u5b57\u7b26\uff0c\u4e5f\u5c31\u662f26\u53c9\u6811\n 9             \/\/\/ <\/summary>\n10             public TrieNode[] childNodes;\n11 \n12             \/\/\/ <summary>\n13             \/\/\/ \u8bcd\u9891\u7edf\u8ba1\n14             \/\/\/ <\/summary>\n15             public int freq;\n16 \n17             \/\/\/ <summary>\n18             \/\/\/ \u8bb0\u5f55\u8be5\u8282\u70b9\u7684\u5b57\u7b26\n19             \/\/\/ <\/summary>\n20             public char nodeChar;\n21 \n22             \/\/\/ <summary>\n23             \/\/\/ \u5931\u8d25\u6307\u9488\n24             \/\/\/ <\/summary>\n25             public TrieNode faliNode;\n26 \n27             \/\/\/ <summary>\n28             \/\/\/ \u63d2\u5165\u8bb0\u5f55\u65f6\u7684\u7f16\u53f7id\n29             \/\/\/ <\/summary>\n30             public HashSet<int> hashSet = new HashSet<int>();\n31 \n32             \/\/\/ <summary>\n33             \/\/\/ \u521d\u59cb\u5316\n34             \/\/\/ <\/summary>\n35             public TrieNode()\n36             {\n37                 childNodes = new TrieNode[26];\n38                 freq = 0;\n39             }\n40         }\n41         #endregion<\/pre>\n
<\/a><\/figure>
<\/span><\/div>\n<\/div>\n\n\n\n
\u521a\u624d\u6211\u4e5f\u8bf4\u5230\u4e86parent\u548ccurrent\u4e24\u4e2a\u8282\u70b9\uff0c\u5728\u7ed9trie\u4e2d\u7684\u8282\u70b9\u8d4bfailnode\u7684\u65f6\u5019\uff0c\u5982\u679c\u91c7\u7528\u6df1\u5ea6\u4f18\u5148\u7684\u8bdd\u8fd8\u662f\u5f88\u9ebb\u70e6\u7684\uff0c\u56e0\u4e3a\u6211\u8981\u5b9e\u65f6<\/p>\n\n\n\n
\u8bb0\u5f55\u5f53\u524d\u8282\u70b9\u7684\u7236\u8282\u70b9\uff0c\u76f8\u4fe1\u5199\u8fc7\u6811\u7684\u670b\u53cb\u90fd\u6e05\u695a\uff0c\u9664\u4e86\u6df1\u641c\uff0c\u6211\u4eec\u8fd8\u6709\u5e7f\u641c\u3002<\/p>\n\n\n\n
\n
<\/a><\/figure>
<\/span><\/div>\n
 1  \/\/\/ <summary>\n 2         \/\/\/ \u6784\u5efa\u5931\u8d25\u6307\u9488(\u8fd9\u91cc\u6211\u4eec\u91c7\u7528BFS\u7684\u505a\u6cd5)\n 3         \/\/\/ <\/summary>\n 4         \/\/\/ <param name=\"root\"><\/param>\n 5         public void BuildFailNodeBFS(ref TrieNode root)\n 6         {\n 7             \/\/\u6839\u8282\u70b9\u5165\u961f\n 8             queue.Enqueue(root);\n 9 \n10             while (queue.Count != 0)\n11             {\n12                 \/\/\u51fa\u961f\n13                 var temp = queue.Dequeue();\n14 \n15                 \/\/\u5931\u8d25\u8282\u70b9\n16                 TrieNode failNode = null;\n17 \n18                 \/\/26\u53c9\u6811\n19                 for (int i = 0; i < 26; i++)\n20                 {\n21                     \/\/\u4ee3\u7801\u6280\u5de7\uff1a\u7528BFS\u65b9\u5f0f\uff0c\u4ece\u5f53\u524d\u8282\u70b9\u627e\u5176\u5b69\u5b50\u8282\u70b9\uff0c\u6b64\u65f6\u5b69\u5b50\u8282\u70b9\n22                     \/\/         \u7684\u7236\u4eb2\u6b63\u662f\u5f53\u524d\u8282\u70b9\uff0c\uff08\u907f\u514d\u4e86parent\u8282\u70b9\u7684\u5b58\u5728\uff09\n23                     if (temp.childNodes[i] == null)\n24                         continue;\n25 \n26                     \/\/\u5982\u679c\u5f53\u524d\u662f\u6839\u8282\u70b9\uff0c\u5219\u6839\u8282\u70b9\u7684\u5931\u8d25\u6307\u9488\u6307\u5411root\n27                     if (temp == root)\n28                     {\n29                         temp.childNodes[i].faliNode = root;\n30                     }\n31                     else\n32                     {\n33                         \/\/\u83b7\u53d6\u51fa\u961f\u8282\u70b9\u7684\u5931\u8d25\u6307\u9488\n34                         failNode = temp.faliNode;\n35 \n36                         \/\/\u6cbf\u7740\u5b83\u7236\u8282\u70b9\u7684\u5931\u8d25\u6307\u9488\u8d70\uff0c\u4e00\u76f4\u8981\u627e\u5230\u4e00\u4e2a\u8282\u70b9\uff0c\u76f4\u5230\u5b83\u7684\u513f\u5b50\u4e5f\u5305\u542b\u8be5\u8282\u70b9\u3002\n37                         while (failNode != null)\n38                         {\n39                             \/\/\u5982\u679c\u4e0d\u4e3a\u7a7a\uff0c\u5219\u5728\u7236\u4eb2\u5931\u8d25\u8282\u70b9\u4e2d\u5f80\u5b50\u8282\u70b9\u4e2d\u6df1\u5165\u3002\n40                             if (failNode.childNodes[i] != null)\n41                             {\n42                                 temp.childNodes[i].faliNode = failNode.childNodes[i];\n43                                 break;\n44                             }\n45                             \/\/\u5982\u679c\u65e0\u6cd5\u6df1\u5165\u5b50\u8282\u70b9\uff0c\u5219\u9000\u56de\u5230\u7236\u4eb2\u5931\u8d25\u8282\u70b9\u5e76\u5411root\u8282\u70b9\u5f80\u6839\u90e8\u5ef6\u4f38\uff0c\u76f4\u5230null\n46                             \/\/\uff08\u4e00\u4e2a\u56de\u6eaf\u518d\u6df1\u5165\u7684\u8fc7\u7a0b\uff0c\u975e\u5e38\u6709\u610f\u601d\uff09\n47                             failNode = failNode.faliNode;\n48                         }\n49 \n50                         \/\/\u7b49\u4e8enull\u7684\u8bdd\uff0c\u6307\u5411root\u8282\u70b9\n51                         if (failNode == null)\n52                             temp.childNodes[i].faliNode = root;\n53                     }\n54                     queue.Enqueue(temp.childNodes[i]);\n55                 }\n56             }\n57         }<\/pre>\n
<\/a><\/figure>
<\/span><\/div>\n<\/div>\n\n\n\n
3\uff1a\u6a21\u5f0f\u5339\u914d<\/p>\n\n\n\n
\u6240\u6709\u5b57\u7b26\u5728\u5339\u914d\u5b8c\u540e\u90fd\u5fc5\u987b\u8981\u8d70failnode\u8282\u70b9\u6765\u7ed3\u675f\u81ea\u5df1\u7684\u65c5\u9014,\u76f8\u5f53\u4e8e\u4e00\u4e2a\u56de\u65cb\uff0c\u8fd9\u6837\u505a\u7684\u76ee\u7684\u9632\u6b62\u5305\u542b\u8282\u70b9\u88ab\u5ffd\u7565\u6389\u3002<\/p>\n\n\n\n
\u6bd4\u5982\uff1a\u6211\u5339\u914d\u5230\u4e86”she”\uff0c\u5fc5\u7136\u4f1a\u5339\u914d\u5230\u8be5\u5b57\u7b26\u4e32\u7684\u540e\u7f00\u201dhe”\uff0c\u8981\u60f3\u5728\u7a0b\u5e8f\u4e2d\u5339\u914d\u5230\uff0c\u5219\u5fc5\u987b\u8282\u70b9\u8981\u8d70\u5931\u8d25\u6307\u9488\u6765\u7ed3\u675f\u81ea\u5df1\u7684\u65c5\u9014\u3002<\/p>\n\n\n\n
\"\"<\/a><\/figure>\n\n\n\n
<\/p>\n\n\n\n
\u4ece\u4e0a\u56fe\u4e2d\u6211\u4eec\u53ef\u4ee5\u6e05\u695a\u7684\u770b\u5230\u201cshe\u201d\u7684\u5339\u914d\u5230\u5b57\u7b26”e”\u540e\uff0c\u4ecefailnode\u6307\u9488\u64a4\u9000\uff0c\u5728\u64a4\u9000\u9014\u4e2d\u5c06\u5176\u540e\u7f00\u5b57\u7b26\u201ce\u201d\u6536\u5165\u56ca\u80bf\uff0c\u8fd9\u4e5f\u5c31\u662f<\/p>\n\n\n\n
\u4e3a\u4ec0\u4e48\u50cfkmp\u4e2d\u7684next\u51fd\u6570\u3002<\/p>\n\n\n\n
\n
<\/a><\/figure>
<\/span><\/div>\n
 1         \/\/\/ <summary>\n 2         \/\/\/ \u6839\u636e\u6307\u5b9a\u7684\u4e3b\u4e32\uff0c\u68c0\u7d22\u662f\u5426\u5b58\u5728\u6a21\u5f0f\u4e32\n 3         \/\/\/ <\/summary>\n 4         \/\/\/ <param name=\"root\"><\/param>\n 5         \/\/\/ <param name=\"s\"><\/param>\n 6         \/\/\/ <returns><\/returns>\n 7         public void SearchAC(ref TrieNode root, string s, ref HashSet<int> hashSet)\n 8         {\n 9             int freq = 0;\n10 \n11             TrieNode head = root;\n12 \n13             foreach (var c in s)\n14             {\n15                 \/\/\u8ba1\u7b97\u4f4d\u7f6e\n16                 int index = c - 'a';\n17 \n18                 \/\/\u5982\u679c\u5f53\u524d\u5339\u914d\u7684\u5b57\u7b26\u5728trie\u6811\u4e2d\u65e0\u5b50\u8282\u70b9\u5e76\u4e14\u4e0d\u662froot\uff0c\u5219\u8981\u8d70\u5931\u8d25\u6307\u9488\n19                 \/\/\u56de\u6eaf\u7684\u53bb\u627e\u5b83\u7684\u5f53\u524d\u8282\u70b9\u7684\u5b50\u8282\u70b9\n20                 while ((head.childNodes[index] == null) && (head != root))\n21                     head = head.faliNode;\n22 \n23                 \/\/\u83b7\u53d6\u8be5\u53c9\u6811\n24                 head = head.childNodes[index];\n25 \n26                 \/\/\u5982\u679c\u4e3a\u7a7a\uff0c\u76f4\u63a5\u7ed9root,\u8868\u793a\u8be5\u5b57\u7b26\u5df2\u7ecf\u8d70\u5b8c\u6bd5\u4e86\n27                 if (head == null)\n28                     head = root;\n29 \n30                 var temp = head;\n31 \n32                 \/\/\u5728trie\u6811\u4e2d\u5339\u914d\u5230\u4e86\u5b57\u7b26\uff0c\u6807\u8bb0\u5f53\u524d\u8282\u70b9\u4e3a\u5df2\u8bbf\u95ee\uff0c\u5e76\u7ee7\u7eed\u5bfb\u627e\u8be5\u8282\u70b9\u7684\u5931\u8d25\u8282\u70b9\u3002\n33                 \/\/\u76f4\u5230root\u7ed3\u675f\uff0c\u76f8\u5f53\u4e8e\u8d70\u4e86\u4e00\u4e2a\u56de\u65cb\u3002(\u6ce8\u610f\uff1a\u6700\u540e\u6211\u4eec\u4f1a\u51fa\u73b0\u4e00\u4e2afreq=-1\u7684\u5931\u8d25\u6307\u9488\u94fe)\n34                 while (temp != root && temp.freq != -1)\n35                 {\n36                     freq += temp.freq;\n37 \n38                     \/\/\u5c06\u627e\u5230\u7684id\u8ffd\u52a0\u5230\u96c6\u5408\u4e2d\n39                     foreach (var item in temp.hashSet)\n40                         hashSet.Add(item);\n41 \n42                     temp.freq = -1;\n43 \n44                     temp = temp.faliNode;\n45                 }\n46             }\n47         }<\/pre>\n
<\/a><\/figure>
<\/span><\/div>\n<\/div>\n\n\n\n
\u597d\u4e86\uff0c\u5230\u73b0\u5728\u4e3a\u6b62\uff0c\u6211\u60f3\u5927\u5bb6\u4e5f\u6bd4\u8f83\u6e05\u695a\u4e86\uff0c\u6700\u540e\u4e0a\u4e00\u4e2a\u603b\u7684\u8fd0\u884c\u4ee3\u7801\uff1a<\/p>\n\n\n\n
\n
\n
<\/a><\/figure>
<\/span><\/div>\n
  1 using System;\n  2 using System.Collections.Generic;\n  3 using System.Linq;\n  4 using System.Text;\n  5 using System.Diagnostics;\n  6 using System.Threading;\n  7 using System.IO;\n  8 \n  9 namespace ConsoleApplication2\n 10 {\n 11     public class Program\n 12     {\n 13         public static void Main()\n 14         {\n 15             Trie trie = new Trie();\n 16 \n 17             trie.AddTrieNode(\"say\", 1);\n 18             trie.AddTrieNode(\"she\", 2);\n 19             trie.AddTrieNode(\"shr\", 3);\n 20             trie.AddTrieNode(\"her\", 4);\n 21             trie.AddTrieNode(\"he\", 5);\n 22 \n 23             trie.BuildFailNodeBFS();\n 24 \n 25             string s = \"yasherhs\";\n 26 \n 27             var hashSet = trie.SearchAC(s);\n 28 \n 29             Console.WriteLine(\"\u5728\u4e3b\u4e32{0}\u4e2d\u5b58\u5728\u6a21\u5f0f\u4e32\u7684\u7f16\u53f7\u4e3a:{1}\", s, string.Join(\",\", hashSet));\n 30 \n 31             Console.Read();\n 32         }\n 33     }\n 34 \n 35     public class Trie\n 36     {\n 37         public TrieNode trieNode = new TrieNode();\n 38 \n 39         \/\/\/ <summary>\n 40         \/\/\/ \u7528\u5149\u641c\u7684\u65b9\u6cd5\u6765\u6784\u5efa\u5931\u8d25\u6307\u9488\n 41         \/\/\/ <\/summary>\n 42         public Queue<TrieNode> queue = new Queue<TrieNode>();\n 43 \n 44         #region Trie\u6811\u8282\u70b9\n 45         \/\/\/ <summary>\n 46         \/\/\/ Trie\u6811\u8282\u70b9\n 47         \/\/\/ <\/summary>\n 48         public class TrieNode\n 49         {\n 50             \/\/\/ <summary>\n 51             \/\/\/ 26\u4e2a\u5b57\u7b26\uff0c\u4e5f\u5c31\u662f26\u53c9\u6811\n 52             \/\/\/ <\/summary>\n 53             public TrieNode[] childNodes;\n 54 \n 55             \/\/\/ <summary>\n 56             \/\/\/ \u8bcd\u9891\u7edf\u8ba1\n 57             \/\/\/ <\/summary>\n 58             public int freq;\n 59 \n 60             \/\/\/ <summary>\n 61             \/\/\/ \u8bb0\u5f55\u8be5\u8282\u70b9\u7684\u5b57\u7b26\n 62             \/\/\/ <\/summary>\n 63             public char nodeChar;\n 64 \n 65             \/\/\/ <summary>\n 66             \/\/\/ \u5931\u8d25\u6307\u9488\n 67             \/\/\/ <\/summary>\n 68             public TrieNode faliNode;\n 69 \n 70             \/\/\/ <summary>\n 71             \/\/\/ \u63d2\u5165\u8bb0\u5f55\u65f6\u7684\u7f16\u53f7id\n 72             \/\/\/ <\/summary>\n 73             public HashSet<int> hashSet = new HashSet<int>();\n 74 \n 75             \/\/\/ <summary>\n 76             \/\/\/ \u521d\u59cb\u5316\n 77             \/\/\/ <\/summary>\n 78             public TrieNode()\n 79             {\n 80                 childNodes = new TrieNode[26];\n 81                 freq = 0;\n 82             }\n 83         }\n 84         #endregion\n 85 \n 86         #region \u63d2\u5165\u64cd\u4f5c\n 87         \/\/\/ <summary>\n 88         \/\/\/ \u63d2\u5165\u64cd\u4f5c\n 89         \/\/\/ <\/summary>\n 90         \/\/\/ <param name=\"word\"><\/param>\n 91         \/\/\/ <param name=\"id\"><\/param>\n 92         public void AddTrieNode(string word, int id)\n 93         {\n 94             AddTrieNode(ref trieNode, word, id);\n 95         }\n 96 \n 97         \/\/\/ <summary>\n 98         \/\/\/ \u63d2\u5165\u64cd\u4f5c\n 99         \/\/\/ <\/summary>\n100         \/\/\/ <param name=\"root\"><\/param>\n101         \/\/\/ <param name=\"s\"><\/param>\n102         public void AddTrieNode(ref TrieNode root, string word, int id)\n103         {\n104             if (word.Length == 0)\n105                 return;\n106 \n107             \/\/\u6c42\u5b57\u7b26\u5730\u5740\uff0c\u65b9\u4fbf\u5c06\u8be5\u5b57\u7b26\u653e\u5165\u523026\u53c9\u6811\u4e2d\u7684\u54ea\u4e00\u53c9\u4e2d\n108             int k = word[0] - 'a';\n109 \n110             \/\/\u5982\u679c\u8be5\u53c9\u6811\u4e3a\u7a7a\uff0c\u5219\u521d\u59cb\u5316\n111             if (root.childNodes[k] == null)\n112             {\n113                 root.childNodes[k] = new TrieNode();\n114 \n115                 \/\/\u8bb0\u5f55\u4e0b\u5b57\u7b26\n116                 root.childNodes[k].nodeChar = word[0];\n117             }\n118 \n119             var nextWord = word.Substring(1);\n120 \n121             \/\/\u8bf4\u660e\u662f\u6700\u540e\u4e00\u4e2a\u5b57\u7b26\uff0c\u7edf\u8ba1\u8be5\u8bcd\u51fa\u73b0\u7684\u6b21\u6570\n122             if (nextWord.Length == 0)\n123             {\n124                 root.childNodes[k].freq++;\n125                 root.childNodes[k].hashSet.Add(id);\n126             }\n127 \n128             AddTrieNode(ref root.childNodes[k], nextWord, id);\n129         }\n130         #endregion\n131 \n132         #region \u6784\u5efa\u5931\u8d25\u6307\u9488\n133         \/\/\/ <summary>\n134         \/\/\/ \u6784\u5efa\u5931\u8d25\u6307\u9488(\u8fd9\u91cc\u6211\u4eec\u91c7\u7528BFS\u7684\u505a\u6cd5)\n135         \/\/\/ <\/summary>\n136         public void BuildFailNodeBFS()\n137         {\n138             BuildFailNodeBFS(ref trieNode);\n139         }\n140 \n141         \/\/\/ <summary>\n142         \/\/\/ \u6784\u5efa\u5931\u8d25\u6307\u9488(\u8fd9\u91cc\u6211\u4eec\u91c7\u7528BFS\u7684\u505a\u6cd5)\n143         \/\/\/ <\/summary>\n144         \/\/\/ <param name=\"root\"><\/param>\n145         public void BuildFailNodeBFS(ref TrieNode root)\n146         {\n147             \/\/\u6839\u8282\u70b9\u5165\u961f\n148             queue.Enqueue(root);\n149 \n150             while (queue.Count != 0)\n151             {\n152                 \/\/\u51fa\u961f\n153                 var temp = queue.Dequeue();\n154 \n155                 \/\/\u5931\u8d25\u8282\u70b9\n156                 TrieNode failNode = null;\n157 \n158                 \/\/26\u53c9\u6811\n159                 for (int i = 0; i < 26; i++)\n160                 {\n161                     \/\/\u4ee3\u7801\u6280\u5de7\uff1a\u7528BFS\u65b9\u5f0f\uff0c\u4ece\u5f53\u524d\u8282\u70b9\u627e\u5176\u5b69\u5b50\u8282\u70b9\uff0c\u6b64\u65f6\u5b69\u5b50\u8282\u70b9\n162                     \/\/         \u7684\u7236\u4eb2\u6b63\u662f\u5f53\u524d\u8282\u70b9\uff0c\uff08\u907f\u514d\u4e86parent\u8282\u70b9\u7684\u5b58\u5728\uff09\n163                     if (temp.childNodes[i] == null)\n164                         continue;\n165 \n166                     \/\/\u5982\u679c\u5f53\u524d\u662f\u6839\u8282\u70b9\uff0c\u5219\u6839\u8282\u70b9\u7684\u5931\u8d25\u6307\u9488\u6307\u5411root\n167                     if (temp == root)\n168                     {\n169                         temp.childNodes[i].faliNode = root;\n170                     }\n171                     else\n172                     {\n173                         \/\/\u83b7\u53d6\u51fa\u961f\u8282\u70b9\u7684\u5931\u8d25\u6307\u9488\n174                         failNode = temp.faliNode;\n175 \n176                         \/\/\u6cbf\u7740\u5b83\u7236\u8282\u70b9\u7684\u5931\u8d25\u6307\u9488\u8d70\uff0c\u4e00\u76f4\u8981\u627e\u5230\u4e00\u4e2a\u8282\u70b9\uff0c\u76f4\u5230\u5b83\u7684\u513f\u5b50\u4e5f\u5305\u542b\u8be5\u8282\u70b9\u3002\n177                         while (failNode != null)\n178                         {\n179                             \/\/\u5982\u679c\u4e0d\u4e3a\u7a7a\uff0c\u5219\u5728\u7236\u4eb2\u5931\u8d25\u8282\u70b9\u4e2d\u5f80\u5b50\u8282\u70b9\u4e2d\u6df1\u5165\u3002\n180                             if (failNode.childNodes[i] != null)\n181                             {\n182                                 temp.childNodes[i].faliNode = failNode.childNodes[i];\n183                                 break;\n184                             }\n185                             \/\/\u5982\u679c\u65e0\u6cd5\u6df1\u5165\u5b50\u8282\u70b9\uff0c\u5219\u9000\u56de\u5230\u7236\u4eb2\u5931\u8d25\u8282\u70b9\u5e76\u5411root\u8282\u70b9\u5f80\u6839\u90e8\u5ef6\u4f38\uff0c\u76f4\u5230null\n186                             \/\/\uff08\u4e00\u4e2a\u56de\u6eaf\u518d\u6df1\u5165\u7684\u8fc7\u7a0b\uff0c\u975e\u5e38\u6709\u610f\u601d\uff09\n187                             failNode = failNode.faliNode;\n188                         }\n189 \n190                         \/\/\u7b49\u4e8enull\u7684\u8bdd\uff0c\u6307\u5411root\u8282\u70b9\n191                         if (failNode == null)\n192                             temp.childNodes[i].faliNode = root;\n193                     }\n194                     queue.Enqueue(temp.childNodes[i]);\n195                 }\n196             }\n197         }\n198         #endregion\n199 \n200         #region \u68c0\u7d22\u64cd\u4f5c\n201         \/\/\/ <summary>\n202         \/\/\/ \u6839\u636e\u6307\u5b9a\u7684\u4e3b\u4e32\uff0c\u68c0\u7d22\u662f\u5426\u5b58\u5728\u6a21\u5f0f\u4e32\n203         \/\/\/ <\/summary>\n204         \/\/\/ <param name=\"s\"><\/param>\n205         \/\/\/ <returns><\/returns>\n206         public HashSet<int> SearchAC(string s)\n207         {\n208             HashSet<int> hash = new HashSet<int>();\n209 \n210             SearchAC(ref trieNode, s, ref hash);\n211 \n212             return hash;\n213         }\n214 \n215         \/\/\/ <summary>\n216         \/\/\/ \u6839\u636e\u6307\u5b9a\u7684\u4e3b\u4e32\uff0c\u68c0\u7d22\u662f\u5426\u5b58\u5728\u6a21\u5f0f\u4e32\n217         \/\/\/ <\/summary>\n218         \/\/\/ <param name=\"root\"><\/param>\n219         \/\/\/ <param name=\"s\"><\/param>\n220         \/\/\/ <returns><\/returns>\n221         public void SearchAC(ref TrieNode root, string s, ref HashSet<int> hashSet)\n222         {\n223             int freq = 0;\n224 \n225             TrieNode head = root;\n226 \n227             foreach (var c in s)\n228             {\n229                 \/\/\u8ba1\u7b97\u4f4d\u7f6e\n230                 int index = c - 'a';\n231 \n232                 \/\/\u5982\u679c\u5f53\u524d\u5339\u914d\u7684\u5b57\u7b26\u5728trie\u6811\u4e2d\u65e0\u5b50\u8282\u70b9\u5e76\u4e14\u4e0d\u662froot\uff0c\u5219\u8981\u8d70\u5931\u8d25\u6307\u9488\n233                 \/\/\u56de\u6eaf\u7684\u53bb\u627e\u5b83\u7684\u5f53\u524d\u8282\u70b9\u7684\u5b50\u8282\u70b9\n234                 while ((head.childNodes[index] == null) && (head != root))\n235                     head = head.faliNode;\n236 \n237                 \/\/\u83b7\u53d6\u8be5\u53c9\u6811\n238                 head = head.childNodes[index];\n239 \n240                 \/\/\u5982\u679c\u4e3a\u7a7a\uff0c\u76f4\u63a5\u7ed9root,\u8868\u793a\u8be5\u5b57\u7b26\u5df2\u7ecf\u8d70\u5b8c\u6bd5\u4e86\n241                 if (head == null)\n242                     head = root;\n243 \n244                 var temp = head;\n245 \n246                 \/\/\u5728trie\u6811\u4e2d\u5339\u914d\u5230\u4e86\u5b57\u7b26\uff0c\u6807\u8bb0\u5f53\u524d\u8282\u70b9\u4e3a\u5df2\u8bbf\u95ee\uff0c\u5e76\u7ee7\u7eed\u5bfb\u627e\u8be5\u8282\u70b9\u7684\u5931\u8d25\u8282\u70b9\u3002\n247                 \/\/\u76f4\u5230root\u7ed3\u675f\uff0c\u76f8\u5f53\u4e8e\u8d70\u4e86\u4e00\u4e2a\u56de\u65cb\u3002(\u6ce8\u610f\uff1a\u6700\u540e\u6211\u4eec\u4f1a\u51fa\u73b0\u4e00\u4e2afreq=-1\u7684\u5931\u8d25\u6307\u9488\u94fe)\n248                 while (temp != root && temp.freq != -1)\n249                 {\n250                     freq += temp.freq;\n251 \n252                     \/\/\u5c06\u627e\u5230\u7684id\u8ffd\u52a0\u5230\u96c6\u5408\u4e2d\n253                     foreach (var item in temp.hashSet)\n254                         hashSet.Add(item);\n255 \n256                     temp.freq = -1;\n257 \n258                     temp = temp.faliNode;\n259                 }\n260             }\n261         }\n262         #endregion\n263     }\n264 }<\/pre>\n
<\/a><\/figure>
<\/span><\/div>\n<\/div>\n<\/div>\n","protected":false},"excerpt":{"rendered":"
\u4e0a\u4e00\u7bc7\u6211\u4eec\u8bf4\u4e86\u5355\u6a21\u5f0f\u5339\u914d\u7b97\u6cd5KMP\uff0c\u73b0\u5728\u6211\u4eec\u6709\u9700\u6c42\u4e86\uff0c\u6211\u8981\u68c0\u67e5\u4e00\u7bc7\u6587\u7ae0\u4e2d\u662f\u5426\u6709\u67d0\u4e9b\u654f\u611f\u8bcd\uff0c\u8fd9\u5176\u5b9e\u5c31\u662f\u591a\u6a21\u5f0f\u5339\u914d … \u9605\u8bfb\u66f4\u591a<\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"_jetpack_memberships_contains_paid_content":false,"footnotes":""},"categories":[5],"tags":[549,550],"class_list":["post-1791","post","type-post","status-publish","format-standard","hentry","category-jishu","tag-ac"],"aioseo_notices":[],"jetpack_featured_media_url":"","jetpack-related-posts":[],"jetpack_sharing_enabled":true,"_links":{"self":[{"href":"https:\/\/cn.hostease.com\/xueyuan\/wp-json\/wp\/v2\/posts\/1791","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/cn.hostease.com\/xueyuan\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/cn.hostease.com\/xueyuan\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/cn.hostease.com\/xueyuan\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/cn.hostease.com\/xueyuan\/wp-json\/wp\/v2\/comments?post=1791"}],"version-history":[{"count":4,"href":"https:\/\/cn.hostease.com\/xueyuan\/wp-json\/wp\/v2\/posts\/1791\/revisions"}],"predecessor-version":[{"id":9284,"href":"https:\/\/cn.hostease.com\/xueyuan\/wp-json\/wp\/v2\/posts\/1791\/revisions\/9284"}],"wp:attachment":[{"href":"https:\/\/cn.hostease.com\/xueyuan\/wp-json\/wp\/v2\/media?parent=1791"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/cn.hostease.com\/xueyuan\/wp-json\/wp\/v2\/categories?post=1791"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/cn.hostease.com\/xueyuan\/wp-json\/wp\/v2\/tags?post=1791"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}