\u54c8\u592b\u66fc\u7f16\u7801\uff08Huffman Coding\uff09\u539f\u7406\u8be6\u89e3-CSDN\u535a\u5ba2<\/strong><\/a><\/p>\n\n\n\n\u633a\u9ebb\u70e6\u7684 \u6e90\u4ee3\u7801\u5982\u4e0b:<\/p>\n\n\n\n
#define _CRT_SECURE_NO_WARNINGS\n#include<stdio.h>\n#include<stdlib.h>\n#include<string.h>\n\/\/\u6784\u5efa\u6811\u8282\u70b9\u548c\u6811\ntypedef struct \n{\n\tunsigned int weight;\n\tunsigned int parent;\n\tunsigned int lchild, rchild;\n}HTNode, * HuffmanTree;\n\n\/\/\u6784\u5efa\u5b58\u653e\u5b57\u7b26\u4e32\u7684\u6570\u7ec4 \u6570\u7ec4\u91cc\u9762\u7684\u6bcf\u4e00\u4e2a\u5143\u7d20\u90fd\u662f\u4e00\u4e2a\u5b57\u7b26\u4e32\ntypedef char** HuffmanCode;\n\n\/\/\u6c42\u6743\u91cd\u6700\u5c0f\u503c\u5e76\u8fdb\u884c\u6807\u8bb0\nint min(HuffmanTree HT, int n)\n{\n\tint flag = 0;\n\tint j = 0;\n\tunsigned int k = UINT_MAX;\n\tfor (j = 1; j <= n; j++)\n\t{\n\t\t\/\/\u6743\u91cd\u8f83\u5c0f\u4e14\u672a\u6807\u8bb0 \u66f4\u65b0\u6700\u5c0f\u503c\u5e76\u6807\u8bb0\u8fd9\u4e2a\u4e0b\u6807\n\t\tif (HT[j].weight <= k && HT[j].parent == 0)\n\t\t{\n\t\t\tk = HT[j].weight;\n\t\t\tflag = j;\n\t\t}\n\t}\n\tHT[flag].parent = 1;\n\treturn flag;\n}\n\n\/\/\u83b7\u5f97\u6743\u91cd\u6700\u5c0f\u7684\u4e24\u4e2a\u7ed3\u70b9\u7684\u4e0b\u6807\nvoid Select(HuffmanTree HT, int n, int& s1, int& s2)\n{\n\ts1 = min(HT, n);\n\ts2 = min(HT, n);\n\tif (s1 > s2)\n\t{\n\t\tint temp = s1;\n\t\ts1 = s2;\n\t\ts2 = temp;\n\t}\n}\n\n\/\/Huffman\u7f16\u7801\u7b97\u6cd5\nvoid HuffmanCoding(HuffmanTree& HT, HuffmanCode& HC, int n, int* w)\n{\n\n\tif (n <= 1)return;\n\t\/\/n\u4e2a\u5b57\u7b26 \u4e00\u5171\u9700\u89812n-1\u4e2a\u7ed3\u70b9\u5b58\u653e\u53e6\u5916\u7684\u6570\u636e\n\t\/\/n0=n2+1;\n\t\/\/n2=n0-1=n-1\n\t\/\/m=n-1+n=2n-1\n\tint m = 2 * n - 1;\n\n\t\/\/\u591a\u7533\u8bf7\u4e00\u4e2a\u8282\u70b9 \u7b2c\u4e00\u4e2a\u8282\u70b9\u4e0d\u5b58\u653e\u4fe1\u606f\n\tHT = (HuffmanTree)malloc((m + 1) * sizeof(HTNode));\n\tHTNode* p;\n\tint i = 1;\n\t\/\/\u521d\u59cb\u5316\u524dn\u4e2a\u8282\u70b9\n\tfor (i = 1, p = HT + 1; i <= n; ++p, ++i, ++w)\n\t{\n\t\tp->weight = *w;\n\t\tp->parent = 0;\n\t\tp->lchild = 0;\n\t\tp->rchild = 0;\n\t}\n\t\/\/\u521d\u59cb\u5316\u540en-1\u4e2a\u7ed3\u70b9\n\tfor (; i <= m; ++i, ++p)\n\t{\n\t\tp->parent = 0;\n\t\tp->lchild = 0;\n\t\tp->rchild = 0;\n\t\tp->weight = 0;\n\t}\n\t\/\/\u66f4\u65b0\u6bcf\u4e2a\u8282\u70b9\u7684parent child weight\u4fe1\u606f\n\tfor (int i = n + 1; i <= m; i++)\n\t{\n\t\tint s1, s2;\n\t\tSelect(HT, i - 1, s1, s2);\n\t\tHT[i].weight = HT[s1].weight + HT[s2].weight;\n\t\tHT[s1].parent = i;\n\t\tHT[s2].parent = i;\n\t\tHT[i].lchild = s1;\n\t\tHT[i].rchild = s2;\n\t}\n\n\tHC = (HuffmanCode)malloc((n + 1) * (sizeof(char*)));\n\n\tchar* cd = (char*)malloc(n * sizeof(char));\n\n\tcd[n - 1] = '\\0';\n\n\tfor (int i = 1; i <= n; i++)\n\t{\n\t\t\/\/\u4ece\u540e\u5f80\u524d\u6dfb\u52a0\u6570\u636e\u4fe1\u606f\n\t\tint start = n - 1;\n\t\t\/\/\u4e00\u76f4\u5faa\u73af\u627e\u7236\u8282\u70b9 \n\t\tfor (int c = i, f = HT[i].parent; f != 0; c = f, f = HT[f].parent)\n\t\t{\n\t\t\t\/\/\u5de60 \u53f31\n\t\t\tif (HT[f].lchild == c)\n\t\t\t{\n\t\t\t\tcd[--start] = '0';\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tcd[--start] = '1';\n\t\t\t}\n\t\t}\n\t\t\/\/\u6839\u636estart\u4f4d\u7f6e\u7533\u8bf7\u5b57\u7b26\u6570\u7ec4\u5927\u5c0f\n\t\tHC[i] = (char*)malloc((n - start) * sizeof(char));\n\t\t\/\/\u4ececd\u6570\u7ec4start\u4f4d\u7f6e\u5f00\u59cb\u590d\u5236\u7ed9HC[i]\n\t\tstrcpy(HC[i], &cd[start]);\n\t}\n\tfree(cd);\n}\n\nint main()\n{\n\tint weights[] = { 7,5,2,4 };\n\tint len = sizeof(weights) \/ sizeof(weights[0]);\n\tHuffmanCode HC;\n\tHuffmanTree HT;\n\tHuffmanCoding(HT, HC, len, weights);\n\tprintf(\"Huffman Codes:\\n\");\n\tfor (int i = 1; i <= len; i++)\n\t{\n\t\tprintf(\"Character %d :%s\\n\", i, HC[i]);\n\t}\n\tfor (int i = 1; i <= len; i++)\n\t{\n\t\tfree(HC[i]);\n\t}\n\tfree(HC);\n\tfree(HT);\n\treturn 0;\n}\n<\/code><\/pre>\n\n\n\n\u6cea\u76ee\u4e86 \u5c0f\u6709\u6210\u5c31\u611f>.<<\/p>\n\n\n\n
<\/p>\n","protected":false},"excerpt":{"rendered":"
\u8fd9\u4e2a\u4e1c\u897f\u641e\u4e86\u6211\u534a\u5929,\u5176\u5b9e\u4e5f\u4e0d\u7b97\u592a\u590d\u6742,\u53ea\u80fd\u8bf4\u6700\u8fd1\u5b66\u4e60\u6548\u7387\u6709\u70b9\u4f4e,\u8fd9\u4e2a\u662f\u4e00\u4e2a\u6c42\u6700\u4f18\u7f16\u7801\u7684\u7b97\u6cd5 \u53ef\u4ee5\u4f7f\u5f97WPL\u6700\u5c0f […]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[4,6],"tags":[],"class_list":["post-162","post","type-post","status-publish","format-standard","hentry","category-4","category-6"],"_links":{"self":[{"href":"https:\/\/womeifei.cn\/index.php\/wp-json\/wp\/v2\/posts\/162","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/womeifei.cn\/index.php\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/womeifei.cn\/index.php\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/womeifei.cn\/index.php\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/womeifei.cn\/index.php\/wp-json\/wp\/v2\/comments?post=162"}],"version-history":[{"count":1,"href":"https:\/\/womeifei.cn\/index.php\/wp-json\/wp\/v2\/posts\/162\/revisions"}],"predecessor-version":[{"id":165,"href":"https:\/\/womeifei.cn\/index.php\/wp-json\/wp\/v2\/posts\/162\/revisions\/165"}],"wp:attachment":[{"href":"https:\/\/womeifei.cn\/index.php\/wp-json\/wp\/v2\/media?parent=162"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/womeifei.cn\/index.php\/wp-json\/wp\/v2\/categories?post=162"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/womeifei.cn\/index.php\/wp-json\/wp\/v2\/tags?post=162"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}
![\"\"](\"https:\/\/womeifei.cn\/wp-content\/uploads\/2024\/10\/image-15.png\")
<\/div><\/figure>\n\n\n\n