{"id":1963,"date":"2017-03-23T16:48:38","date_gmt":"2017-03-23T08:48:38","guid":{"rendered":"http:\/\/cn.hostease.com\/xueyuan\/?p=1963"},"modified":"2025-01-13T19:53:19","modified_gmt":"2025-01-13T11:53:19","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%8d%81%e4%b8%89%e9%a2%98-%e8%b5%ab%e5%a4%ab%e6%9b%bc%e6%a0%91","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%8d%81%e4%b8%89%e9%a2%98-%e8%b5%ab%e5%a4%ab%e6%9b%bc%e6%a0%91\/","title":{"rendered":"\u7ecf\u5178\u7b97\u6cd5\u9898\u6bcf\u65e5\u6f14\u7ec3\u2014\u2014\u7b2c\u5341\u4e09\u9898 \u8d6b\u592b\u66fc\u6811"},"content":{"rendered":"\n

\u8d6b\u592b\u66fc\u6811\u53c8\u79f0\u6700\u4f18\u4e8c\u53c9\u6811\uff0c\u4e5f\u5c31\u662f\u5e26\u6743\u8def\u5f84\u6700\u77ed\u7684\u6811\uff0c\u5bf9\u4e8e\u8d6b\u592b\u66fc\u6811\uff0c\u6211\u60f3\u5927\u5bb6\u5bf9\u5b83\u662f\u975e\u5e38\u7684\u719f\u6089\uff0c\u4e5f\u77e5\u9053\u5b83\u7684\u5e94\u7528\u573a\u666f\uff0c<\/p>\n\n\n\n

\u4f46\u662f\u6709\u6ca1\u6709\u81ea\u5df1\u4eb2\u624b\u5199\u8fc7\uff0c\u8fd9\u4e2a\u6211\u5c31\u4e0d\u6e05\u695a\u4e86\uff0c\u4e0d\u7ba1\u4ee5\u524d\u5199\u6ca1\u5199\uff0c\u8fd9\u4e00\u7bc7\u6211\u4eec\u6765\u73a9\u4e00\u628a\u3002<\/p>\n\n\n\n

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

\u4e00\uff1a\u6982\u5ff5<\/p>\n\n\n\n

\u8d6b\u592b\u66fc\u6811\u91cc\u9762\u6709\u51e0\u4e2a\u6982\u5ff5\uff0c\u4e5f\u662f\u975e\u5e38\u7b80\u5355\u7684\uff0c\u5148\u6765\u770b\u4e0b\u9762\u7684\u56fe\uff1a<\/p>\n\n\n\n

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

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

1. \u57fa\u7840\u6982\u5ff5<\/p>\n\n\n\n

<1>  \u8282\u70b9\u7684\u6743\uff1a \u8282\u70b9\u4e2d\u7ea2\u8272\u90e8\u5206\u5c31\u662f\u6743\uff0c\u5728\u5b9e\u9645\u5e94\u7528\u4e2d\uff0c\u6211\u4eec\u7528\u201c\u5b57\u7b26\u201d\u51fa\u73b0\u7684\u6b21\u6570\u4f5c\u4e3a\u6743\u3002<\/p>\n\n\n\n

<2>  \u8def\u5f84\u957f\u5ea6\uff1a\u53ef\u4ee5\u7406\u89e3\u6210\u8be5\u8282\u70b9\u5230\u6839\u8282\u70b9\u7684\u5c42\u6570\uff0c\u6bd4\u5982\uff1a\u201cA\u201d\u5230\u6839\u8282\u70b9\u7684\u8def\u5f84\u957f\u5ea6\u4e3a3\u3002<\/p>\n\n\n\n

<3>  \u6811\u7684\u8def\u5f84\u957f\u5ea6\uff1a\u5404\u4e2a\u53f6\u5b50\u8282\u70b9\u5230\u6839\u8282\u70b9\u7684\u8def\u5f84\u957f\u5ea6\u603b\u548c\uff0c\u7528WPL\u6807\u8bb0\u3002<\/p>\n\n\n\n

\u6700\u540e\u6211\u4eec\u8981\u8ba8\u8bba\u7684\u7684\u8d6b\u592b\u66fc\u6811\u4e5f\u5c31\u662f\u5e26\u6743\u8def\u5f84\u957f\u5ea6\u6700\u5c0f\u7684\u4e00\u68f5\u6811\u3002<\/p>\n\n\n\n

2.\u6784\u5efa<\/p>\n\n\n\n

\u7531\u4e8e\u8981\u4f7fWPL\u6700\u77ed\uff0c\u8d6b\u592b\u66fc\u6811\u7684\u6784\u5efa\u91c7\u7528\u81ea\u4f4e\u5411\u4e0a\u7684\u65b9\u5f0f\uff0c\u8fd9\u91cc\u6211\u4eec\u91c7\u7528\u5c0f\u6839\u5806\u6765\u5b58\u653e\u5f53\u524d\u9700\u8981\u6784\u5efa\u7684\u5404\u4e2a\u8282\u70b9\uff0c\u6211\u4eec\u7684\u65b9<\/p>\n\n\n\n

\u5f0f\u662f\u6bcf\u6b21\u4ece\u5c0f\u6839\u5806\u4e2d\u53d6\u51fa\u6700\u5c0f\u7684\u4e24\u4e2a\u8282\u70b9\uff0c\u5408\u5e76\u540e\u653e\u5165\u5806\u4e2d\uff0c\u7136\u540e\u7ee7\u7eed\u53d6\u4e24\u4e2a\u6700\u5c0f\u7684\u8282\u70b9\uff0c\u4e00\u76f4\u5230\u5c0f\u6839\u5806\u4e3a\u7a7a\uff0c\u6700\u540e\u6211\u4eec\u91c7\u7528<\/p>\n\n\n\n

\u81ea\u5e95\u5411\u4e0a\u6784\u5efa\u7684\u8d6b\u592b\u66fc\u6811\u4e5f\u5c31\u5b8c\u6bd5\u4e86\u3002<\/p>\n\n\n\n

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

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

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

\u597d\u4e86\uff0c\u8d6b\u592b\u66fc\u6811\u7684\u5178\u578b\u5e94\u7528\u5c31\u662f\u5728\u6570\u636e\u538b\u7f29\u65b9\u9762\uff0c\u4e0b\u9762\u6211\u4eec\u5c31\u8981\u5728\u8d6b\u592b\u66fc\u6811\u4e0a\u9762\u653e\u5165\u8d6b\u592b\u66fc\u7f16\u7801\u4e86\uff0c\u6211\u4eec\u77e5\u9053\u666e\u901a\u7684ASCII\u7801\u662f<\/p>\n\n\n\n

\u91c7\u7528\u7b49\u957f\u7f16\u7801\u7684\uff0c\u5373\u6bcf\u4e2a\u5b57\u7b26\u90fd\u91c7\u75282\u4e2a\u5b57\u8282\uff0c\u800c\u8d6b\u592b\u66fc\u7f16\u7801\u7684\u601d\u60f3\u5c31\u662f\u91c7\u7528\u4e0d\u7b49\u957f\u7684\u601d\u8def\uff0c\u6743\u91cd\u9ad8\u7684\u5b57\u7b26\u9760\u8fd1\u6839\u8282\u70b9\uff0c\u6743\u91cd\u4f4e<\/p>\n\n\n\n

\u7684\u5b57\u7b26\u8fdc\u79bb\u6839\u8282\u70b9\uff0c\u6807\u8bb0\u65b9\u5f0f\u4e3a\u5de6\u5b69\u5b50\u201c0\u201d\uff0c\u53f3\u5b69\u5b50\u201c1\u201d\uff0c\u5982\u4e0b\u56fe\u3002<\/p>\n\n\n\n

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

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

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

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

\u4ece\u56fe\u4e2d\u6211\u4eec\u53ef\u4ee5\u770b\u5230\u5404\u4e2a\u5b57\u7b26\u7684\u8d6b\u592b\u66fc\u7f16\u7801\u4e86\uff0c\u83b7\u53d6\u5b57\u7b26\u7684\u7f16\u7801\u91c7\u7528\u4ece\u6839\u5f80\u4e0b\u7684\u65b9\u5f0f\u6536\u96c6\u8def\u5f84\u4e0a\u7684\u20180,1’\uff0c\u5982\uff1a<\/p>\n\n\n\n

A:110\u3002<\/p>\n\n\n\n

B:111\u3002<\/p>\n\n\n\n

C:0\u3002<\/p>\n\n\n\n

D:10\u3002<\/p>\n\n\n\n

\u6700\u540e\u6211\u4eec\u6765\u6bd4\u8f83\u4ed6\u4eec\u7684WPL\u7684\u957f\u5ea6\uff1a  ASCII\u7801=10*2+20*2+40*2+80*2=300<\/p>\n\n\n\n

\u8d6b\u592b\u66fc\u7801=10*3+20*3+40*2+80*1=250<\/p>\n\n\n\n

\u53ef\u4ee5\u770b\u5230\uff0c\u8d6b\u592b\u66fc\u7801\u538b\u7f29\u4e8650\u4e2a0,1\u5b57\u7b26\uff0c\u592a\u725b\u903c\u4e86\uff0c\u662f\u4e0d\u662f\u554a\u3002\u3002\u3002<\/p>\n\n\n\n

\u4e09\uff1a\u4ee3\u7801<\/p>\n\n\n\n

1. \u6811\u8282\u70b9<\/p>\n\n\n\n

\u6211\u4eec\u91c7\u75287\u5143\u8282\u70b9\uff0c\u5176\u4e2dparent\u65b9\u4fbf\u6211\u4eec\u5728DFS\u7684\u65f6\u5019\u627e\u5230\u4ece\u53f6\u5b50\u8282\u70b9\u5230\u6839\u8282\u70b9\u7684\u8def\u5f84\u4e0a\u7684\u8d6b\u592b\u66fc\u7f16\u7801\u3002<\/p>\n\n\n\n

\n
<\/span><\/div>\n
 1 #region \u8d6b\u592b\u66fc\u8282\u70b9\n 2         \/\/\/ <summary>\n 3         \/\/\/ \u8d6b\u592b\u66fc\u8282\u70b9\n 4         \/\/\/ <\/summary>\n 5         public class Node\n 6         {\n 7             \/\/\/ <summary>\n 8             \/\/\/ \u5de6\u5b69\u5b50\n 9             \/\/\/ <\/summary>\n10             public Node left;\n11 \n12             \/\/\/ <summary>\n13             \/\/\/ \u53f3\u5b69\u5b50\n14             \/\/\/ <\/summary>\n15             public Node right;\n16 \n17             \/\/\/ <summary>\n18             \/\/\/ \u7236\u8282\u70b9\n19             \/\/\/ <\/summary>\n20             public Node parent;\n21 \n22             \/\/\/ <summary>\n23             \/\/\/ \u8282\u70b9\u5b57\u7b26\n24             \/\/\/ <\/summary>\n25             public char c;\n26 \n27             \/\/\/ <summary>\n28             \/\/\/ \u8282\u70b9\u6743\u91cd\n29             \/\/\/ <\/summary>\n30             public int weight;\n31 \n32             \/\/\u8d6b\u592b\u66fc\u201c0\"or\u201c1\"\n33             public char huffmancode;\n34 \n35             \/\/\/ <summary>\n36             \/\/\/ \u6807\u8bb0\u662f\u5426\u4e3a\u53f6\u5b50\u8282\u70b9\n37             \/\/\/ <\/summary>\n38             public bool isLeaf;\n39         }\n40         #endregion<\/pre>\n
<\/span><\/div>\n<\/div>\n\n\n\n
 <\/p>\n\n\n\n
1. \u6784\u5efa\u8d6b\u592b\u66fc\u6811\uff08Build\uff09<\/p>\n\n\n\n
\u4e0a\u9762\u4e5f\u8bf4\u4e86\uff0c\u6784\u5efa\u8d6b\u592b\u66fc\u7f16\u7801\u6811\u6211\u4eec\u91c7\u7528\u5c0f\u6839\u5806\u7684\u5f62\u5f0f\u6784\u5efa\uff0c\u6784\u5efa\u5b8c\u540e\uff0c\u6211\u4eec\u91c7\u7528DFS\u7684\u65b9\u5f0f\u7edf\u8ba1\u5404\u4e2a\u5b57\u7b26\u7684\u7f16\u7801\uff0c\u590d\u6742\u5ea6\u4e3aN*logN\u3002<\/p>\n\n\n\n
\u5173\u4e8e\u5c0f\u6839\u5806\uff08\u8be6\u7ec6\u5185\u5bb9\u53ef\u4ee5\u53c2\u8003\u6211\u7684\u7cfb\u5217\u6587\u7ae0 “\u4f18\u5148\u961f\u5217<\/a>“\uff09<\/p>\n\n\n\n
\n
<\/span><\/div>\n
 1 #region \u6784\u5efa\u8d6b\u592b\u66fc\u6811\n 2         \/\/\/ <summary>\n 3         \/\/\/ \u6784\u5efa\u8d6b\u592b\u66fc\u6811\n 4         \/\/\/ <\/summary>\n 5         public void Build()\n 6         {\n 7             \/\/\u6784\u5efa\n 8             while (queue.Count() > 0)\n 9             {\n10                 \/\/\u5982\u679c\u53ea\u6709\u4e00\u4e2a\u8282\u70b9\uff0c\u5219\u8bf4\u660e\u5df2\u7ecf\u5230\u6839\u8282\u70b9\u4e86\n11                 if (queue.Count() == 1)\n12                 {\n13                     root = queue.Dequeue().t;\n14 \n15                     break;\n16                 }\n17 \n18                 \/\/\u8282\u70b91\n19                 var node1 = queue.Dequeue();\n20 \n21                 \/\/\u8282\u70b92\n22                 var node2 = queue.Dequeue();\n23 \n24                 \/\/\u6807\u8bb0\u5de6\u5b69\u5b50\n25                 node1.t.huffmancode = '0';\n26 \n27                 \/\/\u6807\u8bb0\u4e3a\u53f3\u5b69\u5b50\n28                 node2.t.huffmancode = '1';\n29 \n30                 \/\/\u5224\u65ad\u5f53\u524d\u8282\u70b9\u662f\u5426\u4e3a\u53f6\u5b50\u8282\u70b9,hufuman\u65e0\u5ea6\u4e3a1\u70b9\u8282\u70b9\uff08\u65b9\u4fbf\u8ba1\u7b97huffman\u7f16\u7801\uff09\n31                 if (node1.t.left == null)\n32                     node1.t.isLeaf = true;\n33 \n34                 if (node2.t.left == null)\n35                     node2.t.isLeaf = true;\n36 \n37                 \/\/\u7236\u8282\u70b9\n38                 root = new Node();\n39 \n40                 root.left = node1.t;\n41 \n42                 root.right = node2.t;\n43 \n44                 root.weight = node1.t.weight + node2.t.weight;\n45 \n46                 \/\/\u5f53\u524d\u8282\u70b9\u4e3a\u6839\u8282\u70b9\n47                 node1.t.parent = node2.t.parent = root;\n48 \n49                 \/\/\u5c06\u5f53\u524d\u8282\u70b9\u7684\u7236\u8282\u70b9\u5165\u961f\u5217\n50                 queue.Eequeue(root, root.weight);\n51             }\n52 \n53             \/\/\u6df1\u5ea6\u4f18\u5148\u7edf\u8ba1\u5404\u4e2a\u5b57\u7b26\u7684\u7f16\u7801\n54             DFS(root);\n55         }\n56         #endregion<\/pre>\n
<\/span><\/div>\n<\/div>\n\n\n\n
 <\/p>\n\n\n\n
2\uff1a\u7f16\u7801(Encode,Decode)<\/p>\n\n\n\n
\u6811\u6784\u5efa\u8d77\u6765\u540e\uff0c\u6211\u4f1a\u7528\u5b57\u5178\u6765\u4fdd\u5b58\u5b57\u7b26\u548c\u201d\u8d6b\u592b\u66fc\u7f16\u7801\u201c\u7684\u5bf9\u5e94\u8868\uff0c\u7136\u540e\u62ff\u7740\u660e\u6587\u6216\u8005\u5bc6\u6587\u5bf9\u7740\u7f16\u7801\u8868\u7ffb\u8bd1\u5c31\u884c\u4e86\uff0c \u590d\u6742\u5ea6O(N)\u3002<\/p>\n\n\n\n
 <\/p>\n\n\n\n
\n
<\/span><\/div>\n
 1         #region \u8d6b\u592b\u66fc\u7f16\u7801\n 2         \/\/\/ <summary>\n 3         \/\/\/ \u8d6b\u592b\u66fc\u7f16\u7801\n 4         \/\/\/ <\/summary>\n 5         \/\/\/ <returns><\/returns>\n 6         public string Encode()\n 7         {\n 8             StringBuilder sb = new StringBuilder();\n 9 \n10             foreach (var item in word)\n11             {\n12                 sb.Append(huffmanEncode[item]);\n13             }\n14 \n15             return sb.ToString();\n16         }\n17         #endregion\n18 \n19         #region \u8d6b\u592b\u66fc\u89e3\u7801\n20         \/\/\/ <summary>\n21         \/\/\/ \u8d6b\u592b\u66fc\u89e3\u7801\n22         \/\/\/ <\/summary>\n23         \/\/\/ <returns><\/returns>\n24         public string Decode(string str)\n25         {\n26             StringBuilder decode = new StringBuilder();\n27 \n28             string temp = string.Empty;\n29 \n30             for (int i = 0; i < str.Length; i++)\n31             {\n32                 temp += str[i].ToString();\n33 \n34                 \/\/\u5982\u679c\u5305\u542b O(N)\u65f6\u95f4\n35                 if (huffmanDecode.ContainsKey(temp))\n36                 {\n37                     decode.Append(huffmanDecode[temp]);\n38 \n39                     temp = string.Empty;\n40                 }\n41             }\n42 \n43             return decode.ToString();\n44         }\n45         #endregion<\/pre>\n
<\/span><\/div>\n<\/div>\n\n\n\n
\u6700\u540e\u6211\u4eec\u505a\u4e2a\u4f8b\u5b50\uff0c\u538b\u7f299M\u7684\u6587\u4ef6\uff0c\u770b\u770b\u5230\u5e95\u80fd\u538b\u7f29\u591a\u5c11\uff1f<\/p>\n\n\n\n
\n
<\/span><\/div>\n
 1  public static void Main()\n 2         {\n 3             StringBuilder sb = new StringBuilder();\n 4 \n 5             for (int i = 0; i < 1 * 10000; i++)\n 6             {\n 7                 sb.Append(\"\u4eba\u6c11\u7f51\u5317\u4eac12\u67088\u65e5\u7535 \uff08\u8bb0\u8005 \u5b8b\u5fc3\u854a\uff09 \u5317\u4eac\u65f6\u95f48\u65e5\u665a\u7684\u592e\u89c6\u300a\u65b0\u95fb\u8054\u64ad\u300b\u8282\u76ee\u51fa\u73b0\u4e86\u76f4\u64ad\u5931\u8bef\u3002\u4e0a\u4e00\u6761\u65b0\u95fb\u5c1a\u672a\u64ad\u653e\u5b8c\u6bd5\u65f6\uff0c\u64ad\u5c31\u5c06\u753b\u9762\u5207\u6362\u56de\u4e86\u6f14\u64ad\u95f4\uff0c\u4e3b\u64ad\u674e\u6893\u840c\u5f00\u59cb\u64ad\u62a5\u4e0b\u4e00\u6761\u65b0\u95fb\uff0c\u5bfc\u81f4\u4e24\u6761\u65b0\u95fb\u51fa\u73b0\u4e86\u201c\u6df7\u97f3\u201d\u64ad\u51fa\u3002\u592e\u89c6\u65b0\u95fb\u5b98\u65b9\u5fae\u535a\u8d26\u53f7\u572821\u70b909\u5206\u53d1\u5e03\u4e86\u4e00\u6761\u81f4\u6b49\u5fae\u535a\uff1a\u3010\u81f4\u6b49\u3011\u4eca\u665a\u300a\u65b0\u95fb\u8054\u64ad\u300b\u56e0\u5bfc\u64ad\u5458\u53e3\u4ee4\u5931\u8bef\uff0c\u5bfc\u81f4\u753b\u9762\u5207\u6362\u9519\u8bef\uff0c\u7279\u6b64\u5411\u89c2\u4f17\u670b\u53cb\u8868\u793a\u6b49\u610f\u3002\u592e\u89c6\u7279\u7ea6\u8bc4\u8bba\u5458\u6768\u79b9\u5728\u4e2a\u4eba\u5fae\u535a\u4e2d\u5199\u9053\uff1a\u4eca\u665a\u300a\u65b0\u95fb\u8054\u64ad\u300b\u51fa\u4e86\u4e2a\u5207\u6362\u9519\u8bef\uff0c@\u592e\u89c6\u65b0\u95fb \u53ca\u65f6\u505a\u4e86\u8bda\u6073\u9053\u6b49\u3002\u8054\u64ad\u4e00\u76f4\u5949\u884c\u201c\u91d1\u6807\u51c6\u201d\uff0c\u538b\u529b\u6e90\u81ea\u5168\u793e\u4f1a\u7684\u9ad8\u8981\u6c42\u3002\u5176\u5b9e\u62a5\u7eb8\u4ea6\u90fd\u6709\u201c\u52d8\u8bef\u201d\u4e00\u680f\uff0c\u5766\u8bda\u7ea0\u9519\u4e0e\u9053\u6b49\u3002\u300a\u65b0\u95fb\u8054\u64ad\u300b\u662f\u4e2d\u56fd\u5f71\u54cd\u529b\u6700\u5927\u7684\u7535\u89c6\u65b0\u95fb\u8282\u76ee\u3002\u5b83\u6709\u4e0d\u53ef\u66ff\u4ee3\u7684\u7b26\u53f7\u611f\uff0c\u5b83\u6709\u5931\u8bef\uff0c\u66f4\u6709\u6084\u7136\u7684\u8fdb\u6b65\u3002\u65b0\u7684\u6539\u8fdb\u6b63\u5728\u6216\u5373\u5c06\u53d1\u751f\uff0c\u4e0d\u59a8\u671f\u5f85\");\n 8             }\n 9 \n10             File.WriteAllText(Environment.CurrentDirectory + \"\/\/1.txt\", sb.ToString());\n11 \n12             Huffman huffman = new Huffman(sb.ToString());\n13 \n14             Stopwatch watch = Stopwatch.StartNew();\n15 \n16             huffman.Build();\n17 \n18             watch.Stop();\n19 \n20             Console.WriteLine(\"\u6784\u5efa\u8d6b\u592b\u66fc\u6811\u8017\u8d39:{0}\", watch.ElapsedMilliseconds);\n21 \n22             \/\/\u5c068\u4f4d\u4e8c\u8fdb\u5236\u8f6c\u5316\u4e3aascII\u7801\n23             var s = huffman.Encode();\n24 \n25             var remain = s.Length % 8;\n26 \n27             List<char> list = new List<char>();\n28 \n29             var start = 0;\n30 \n31             for (int i = 8; i < s.Length; i = i + 8)\n32             {\n33                 list.Add((char)Convert.ToInt32(s.Substring(i - 8, 8), 2));\n34 \n35                 start = i;\n36             }\n37 \n38             var result = new String(list.ToArray());\n39 \n40             \/\/\u5f53\u5b57\u7b26\u7f16\u7801\u4e0d\u8db38\u4f4d\u65f6\uff0c \u7528\u2018\u8279'\u6765\u6807\u8bb0\uff0c\u7136\u540e\u62ff\u51fa\u2019\u64e6\u2018\u4ee5\u540e\u7684\u6240\u67090,1\u5373\u53ef\n41             result += \"\u8279\" + s.Substring(start);\n42 \n43             File.WriteAllText(Environment.CurrentDirectory + \"\/\/2.txt\", result);\n44 \n45             Console.WriteLine(\"\u538b\u7f29\u5b8c\u6bd5\uff01\");\n46 \n47             Console.Read();\n48 \n49             \/\/\u89e3\u7801\n50             var str = File.ReadAllText(Environment.CurrentDirectory + \"\/\/2.txt\");\n51 \n52             sb.Clear();\n53 \n54             for (int i = 0; i < str.Length; i++)\n55             {\n56                 int ua = (int)str[i];\n57 \n58                 \/\/\u8bf4\u660e\u5df2\u7ecf\u53d6\u5b8c\u6bd5\u4e86  \u7528'\u8279'\u6765\u505a\u6807\u8bb0\n59                 if (ua == 33401)\n60                     sb.Append(str.Substring(i));\n61                 else\n62                     sb.Append(Convert.ToString(ua, 2).PadLeft(8, '0'));\n63             }\n64 \n65             var sss = huffman.Decode(sb.ToString());\n66 \n67             Console.Read();\n68         }<\/pre>\n
<\/span><\/div>\n<\/div>\n\n\n\n
\"\"<\/a><\/figure>\n\n\n\n
<\/p>\n\n\n\n
 <\/p>\n\n\n\n
\u770b\u770b\uff0c\u591a\u5e05\u6c14\uff0c\u5c069M\u7684\u6587\u4ef6\u538b\u7f29\u5230\u4e864M\uff0c\u540c\u65f6\u6211\u4e5f\u6253\u5f00\u4e86\u538b\u7f29\u540e\u7684\u79d8\u6587\uff0c\u76f8\u4fe1\u8fd9\u4e9b\u4e1c\u897f\u662f\u4ec0\u4e48\uff0c\u4f60\u61c2\u6211\u61c2\u7684\u3002<\/p>\n\n\n\n
\u4e3b\u7a0b\u5e8f\uff1a<\/p>\n\n\n\n
 <\/p>\n\n\n\n
\u5c0f\u6839\u5806\uff1a<\/p>\n\n\n\n
View Code\n
\n
<\/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 PriorityQueue<T> where T : class\n 12     {\n 13         \/\/\/ <summary>\n 14         \/\/\/ \u5b9a\u4e49\u4e00\u4e2a\u6570\u7ec4\u6765\u5b58\u653e\u8282\u70b9\n 15         \/\/\/ <\/summary>\n 16         private List<HeapNode> nodeList = new List<HeapNode>();\n 17 \n 18         #region \u5806\u8282\u70b9\u5b9a\u4e49\n 19         \/\/\/ <summary>\n 20         \/\/\/ \u5806\u8282\u70b9\u5b9a\u4e49\n 21         \/\/\/ <\/summary>\n 22         public class HeapNode\n 23         {\n 24             \/\/\/ <summary>\n 25             \/\/\/ \u5b9e\u4f53\u6570\u636e\n 26             \/\/\/ <\/summary>\n 27             public T t { get; set; }\n 28 \n 29             \/\/\/ <summary>\n 30             \/\/\/ \u4f18\u5148\u7ea7\u522b 1-10\u4e2a\u7ea7\u522b (\u4f18\u5148\u7ea7\u522b\u9012\u589e)\n 31             \/\/\/ <\/summary>\n 32             public int level { get; set; }\n 33 \n 34             public HeapNode(T t, int level)\n 35             {\n 36                 this.t = t;\n 37                 this.level = level;\n 38             }\n 39 \n 40             public HeapNode() { }\n 41         }\n 42         #endregion\n 43 \n 44         #region  \u6dfb\u52a0\u64cd\u4f5c\n 45         \/\/\/ <summary>\n 46         \/\/\/ \u6dfb\u52a0\u64cd\u4f5c\n 47         \/\/\/ <\/summary>\n 48         public void Eequeue(T t, int level = 1)\n 49         {\n 50             \/\/\u5c06\u5f53\u524d\u8282\u70b9\u8ffd\u52a0\u5230\u5806\u5c3e\n 51             nodeList.Add(new HeapNode(t, level));\n 52 \n 53             \/\/\u5982\u679c\u53ea\u6709\u4e00\u4e2a\u8282\u70b9\uff0c\u5219\u4e0d\u9700\u8981\u8fdb\u884c\u7b5b\u64cd\u4f5c\n 54             if (nodeList.Count == 1)\n 55                 return;\n 56 \n 57             \/\/\u83b7\u53d6\u6700\u540e\u4e00\u4e2a\u975e\u53f6\u5b50\u8282\u70b9\n 58             int parent = nodeList.Count \/ 2 - 1;\n 59 \n 60             \/\/\u5806\u8c03\u6574\n 61             UpHeapAdjust(nodeList, parent);\n 62         }\n 63         #endregion\n 64 \n 65         #region \u5bf9\u5806\u8fdb\u884c\u4e0a\u6ee4\u64cd\u4f5c\uff0c\u4f7f\u5f97\u6ee1\u8db3\u5806\u6027\u8d28\n 66         \/\/\/ <summary>\n 67         \/\/\/ \u5bf9\u5806\u8fdb\u884c\u4e0a\u6ee4\u64cd\u4f5c\uff0c\u4f7f\u5f97\u6ee1\u8db3\u5806\u6027\u8d28\n 68         \/\/\/ <\/summary>\n 69         \/\/\/ <param name=\"nodeList\"><\/param>\n 70         \/\/\/ <param name=\"index\">\u975e\u53f6\u5b50\u8282\u70b9\u7684\u4e4b\u540e\u6307\u9488\uff08\u8fd9\u91cc\u8981\u6ce8\u610f\uff1a\u6211\u4eec\n 71         \/\/\/ \u7684\u7b5b\u64cd\u4f5c\u65f6\u9488\u5bf9\u975e\u53f6\u8282\u70b9\u7684\uff09\n 72         \/\/\/ <\/param>\n 73         public void UpHeapAdjust(List<HeapNode> nodeList, int parent)\n 74         {\n 75             while (parent >= 0)\n 76             {\n 77                 \/\/\u5f53\u524dindex\u8282\u70b9\u7684\u5de6\u5b69\u5b50\n 78                 var left = 2 * parent + 1;\n 79 \n 80                 \/\/\u5f53\u524dindex\u8282\u70b9\u7684\u53f3\u5b69\u5b50\n 81                 var right = left + 1;\n 82 \n 83                 \/\/parent\u5b50\u8282\u70b9\u4e2d\u6700\u5927\u7684\u5b69\u5b50\u8282\u70b9\uff0c\u65b9\u4fbf\u4e8eparent\u8fdb\u884c\u6bd4\u8f83\n 84                 \/\/\u9ed8\u8ba4\u4e3aleft\u8282\u70b9\n 85                 var min = left;\n 86 \n 87                 \/\/\u5224\u65ad\u5f53\u524d\u8282\u70b9\u662f\u5426\u6709\u53f3\u5b69\u5b50\n 88                 if (right < nodeList.Count)\n 89                 {\n 90                     \/\/\u5224\u65adparent\u8981\u6bd4\u8f83\u7684\u6700\u5927\u5b50\u8282\u70b9\n 91                     min = nodeList[left].level < nodeList[right].level ? left : right;\n 92                 }\n 93 \n 94                 \/\/\u5982\u679cparent\u8282\u70b9\u5927\u4e8e\u5b83\u7684\u67d0\u4e2a\u5b50\u8282\u70b9\u7684\u8bdd\uff0c\u6b64\u65f6\u7b5b\u64cd\u4f5c\n 95                 if (nodeList[parent].level > nodeList[min].level)\n 96                 {\n 97                     \/\/\u5b50\u8282\u70b9\u548c\u7236\u8282\u70b9\u8fdb\u884c\u4ea4\u6362\u64cd\u4f5c\n 98                     var temp = nodeList[parent];\n 99                     nodeList[parent] = nodeList[min];\n100                     nodeList[min] = temp;\n101 \n102                     \/\/\u7ee7\u7eed\u8fdb\u884c\u66f4\u4e0a\u4e00\u5c42\u7684\u8fc7\u6ee4\n103                     parent = (int)Math.Ceiling(parent \/ 2d) - 1;\n104                 }\n105                 else\n106                 {\n107                     break;\n108                 }\n109             }\n110         }\n111         #endregion\n112 \n113         #region \u4f18\u5148\u961f\u5217\u7684\u51fa\u961f\u64cd\u4f5c\n114         \/\/\/ <summary>\n115         \/\/\/ \u4f18\u5148\u961f\u5217\u7684\u51fa\u961f\u64cd\u4f5c\n116         \/\/\/ <\/summary>\n117         \/\/\/ <returns><\/returns>\n118         public HeapNode Dequeue()\n119         {\n120             if (nodeList.Count == 0)\n121                 return null;\n122 \n123             \/\/\u51fa\u961f\u5217\u64cd\u4f5c\uff0c\u5f39\u51fa\u6570\u636e\u5934\u5143\u7d20\n124             var pop = nodeList[0];\n125 \n126             \/\/\u7528\u5c3e\u5143\u7d20\u586b\u5145\u5934\u5143\u7d20\n127             nodeList[0] = nodeList[nodeList.Count - 1];\n128 \n129             \/\/\u5220\u9664\u5c3e\u8282\u70b9\n130             nodeList.RemoveAt(nodeList.Count - 1);\n131 \n132             \/\/\u7136\u540e\u4ece\u6839\u8282\u70b9\u4e0b\u6ee4\u5806\n133             DownHeapAdjust(nodeList, 0);\n134 \n135             return pop;\n136         }\n137         #endregion\n138 \n139         #region  \u5bf9\u5806\u8fdb\u884c\u4e0b\u6ee4\u64cd\u4f5c\uff0c\u4f7f\u5f97\u6ee1\u8db3\u5806\u6027\u8d28\n140         \/\/\/ <summary>\n141         \/\/\/ \u5bf9\u5806\u8fdb\u884c\u4e0b\u6ee4\u64cd\u4f5c\uff0c\u4f7f\u5f97\u6ee1\u8db3\u5806\u6027\u8d28\n142         \/\/\/ <\/summary>\n143         \/\/\/ <param name=\"nodeList\"><\/param>\n144         \/\/\/ <param name=\"index\">\u975e\u53f6\u5b50\u8282\u70b9\u7684\u4e4b\u540e\u6307\u9488\uff08\u8fd9\u91cc\u8981\u6ce8\u610f\uff1a\u6211\u4eec\n145         \/\/\/ \u7684\u7b5b\u64cd\u4f5c\u65f6\u9488\u5bf9\u975e\u53f6\u8282\u70b9\u7684\uff09\n146         \/\/\/ <\/param>\n147         public void DownHeapAdjust(List<HeapNode> nodeList, int parent)\n148         {\n149             while (2 * parent + 1 < nodeList.Count)\n150             {\n151                 \/\/\u5f53\u524dindex\u8282\u70b9\u7684\u5de6\u5b69\u5b50\n152                 var left = 2 * parent + 1;\n153 \n154                 \/\/\u5f53\u524dindex\u8282\u70b9\u7684\u53f3\u5b69\u5b50\n155                 var right = left + 1;\n156 \n157                 \/\/parent\u5b50\u8282\u70b9\u4e2d\u6700\u5927\u7684\u5b69\u5b50\u8282\u70b9\uff0c\u65b9\u4fbf\u4e8eparent\u8fdb\u884c\u6bd4\u8f83\n158                 \/\/\u9ed8\u8ba4\u4e3aleft\u8282\u70b9\n159                 var min = left;\n160 \n161                 \/\/\u5224\u65ad\u5f53\u524d\u8282\u70b9\u662f\u5426\u6709\u53f3\u5b69\u5b50\n162                 if (right < nodeList.Count)\n163                 {\n164                     \/\/\u5224\u65adparent\u8981\u6bd4\u8f83\u7684\u6700\u5927\u5b50\u8282\u70b9\n165                     min = nodeList[left].level < nodeList[right].level ? left : right;\n166                 }\n167 \n168                 \/\/\u5982\u679cparent\u8282\u70b9\u5c0f\u4e8e\u5b83\u7684\u67d0\u4e2a\u5b50\u8282\u70b9\u7684\u8bdd\uff0c\u6b64\u65f6\u7b5b\u64cd\u4f5c\n169                 if (nodeList[parent].level > nodeList[min].level)\n170                 {\n171                     \/\/\u5b50\u8282\u70b9\u548c\u7236\u8282\u70b9\u8fdb\u884c\u4ea4\u6362\u64cd\u4f5c\n172                     var temp = nodeList[parent];\n173                     nodeList[parent] = nodeList[min];\n174                     nodeList[min] = temp;\n175 \n176                     \/\/\u7ee7\u7eed\u8fdb\u884c\u66f4\u4e0b\u4e00\u5c42\u7684\u8fc7\u6ee4\n177                     parent = min;\n178                 }\n179                 else\n180                 {\n181                     break;\n182                 }\n183             }\n184         }\n185         #endregion\n186 \n187         #region \u83b7\u53d6\u5143\u7d20\u5e76\u4e0b\u964d\u5230\u6307\u5b9a\u7684level\u7ea7\u522b\n188         \/\/\/ <summary>\n189         \/\/\/ \u83b7\u53d6\u5143\u7d20\u5e76\u4e0b\u964d\u5230\u6307\u5b9a\u7684level\u7ea7\u522b\n190         \/\/\/ <\/summary>\n191         \/\/\/ <returns><\/returns>\n192         public HeapNode GetAndDownPriority(int level)\n193         {\n194             if (nodeList.Count == 0)\n195                 return null;\n196 \n197             \/\/\u83b7\u53d6\u5934\u5143\u7d20\n198             var pop = nodeList[0];\n199 \n200             \/\/\u8bbe\u7f6e\u6307\u5b9a\u4f18\u5148\u7ea7\uff08\u5982\u679c\u4e3a MinValue \u5219\u4e3a -- \u64cd\u4f5c\uff09\n201             nodeList[0].level = level == int.MinValue ? --nodeList[0].level : level;\n202 \n203             \/\/\u4e0b\u6ee4\u5806\n204             DownHeapAdjust(nodeList, 0);\n205 \n206             return nodeList[0];\n207         }\n208         #endregion\n209 \n210         #region \u83b7\u53d6\u5143\u7d20\u5e76\u4e0b\u964d\u4f18\u5148\u7ea7\n211         \/\/\/ <summary>\n212         \/\/\/ \u83b7\u53d6\u5143\u7d20\u5e76\u4e0b\u964d\u4f18\u5148\u7ea7\n213         \/\/\/ <\/summary>\n214         \/\/\/ <returns><\/returns>\n215         public HeapNode GetAndDownPriority()\n216         {\n217             \/\/\u4e0b\u964d\u4e00\u4e2a\u4f18\u5148\u7ea7\n218             return GetAndDownPriority(int.MinValue);\n219         }\n220         #endregion\n221 \n222         #region \u8fd4\u56de\u5f53\u524d\u4f18\u5148\u961f\u5217\u4e2d\u7684\u5143\u7d20\u4e2a\u6570\n223         \/\/\/ <summary>\n224         \/\/\/ \u8fd4\u56de\u5f53\u524d\u4f18\u5148\u961f\u5217\u4e2d\u7684\u5143\u7d20\u4e2a\u6570\n225         \/\/\/ <\/summary>\n226         \/\/\/ <returns><\/returns>\n227         public int Count()\n228         {\n229             return nodeList.Count;\n230         }\n231         #endregion\n232     }\n233 }\n\n\n\u6587\u7ae0\u6765\u81ea\u7f51\u7edc\u535a\u5ba2\u3002\u539f\u6587\u5730\u5740https:\/\/www.cnblogs.com\/huangxincheng\/archive\/2012\/12\/09\/2809993.html<\/pre>\n<\/div>\n<\/div>\n","protected":false},"excerpt":{"rendered":"
\u8d6b\u592b\u66fc\u6811\u53c8\u79f0\u6700\u4f18\u4e8c\u53c9\u6811\uff0c\u4e5f\u5c31\u662f\u5e26\u6743\u8def\u5f84\u6700\u77ed\u7684\u6811\uff0c\u5bf9\u4e8e\u8d6b\u592b\u66fc\u6811\uff0c\u6211\u60f3\u5927\u5bb6\u5bf9\u5b83\u662f\u975e\u5e38\u7684\u719f\u6089\uff0c\u4e5f\u77e5\u9053\u5b83\u7684\u5e94\u7528\u573a\u666f\uff0c  … \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":[593,584,592],"class_list":["post-1963","post","type-post","status-publish","format-standard","hentry","category-jishu","tag-593","tag-584","tag-592"],"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\/1963","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=1963"}],"version-history":[{"count":5,"href":"https:\/\/cn.hostease.com\/xueyuan\/wp-json\/wp\/v2\/posts\/1963\/revisions"}],"predecessor-version":[{"id":9352,"href":"https:\/\/cn.hostease.com\/xueyuan\/wp-json\/wp\/v2\/posts\/1963\/revisions\/9352"}],"wp:attachment":[{"href":"https:\/\/cn.hostease.com\/xueyuan\/wp-json\/wp\/v2\/media?parent=1963"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/cn.hostease.com\/xueyuan\/wp-json\/wp\/v2\/categories?post=1963"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/cn.hostease.com\/xueyuan\/wp-json\/wp\/v2\/tags?post=1963"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}