C語(yǔ)言哈夫曼編碼代碼

1、最新文件 方便更改僅供參考 - 已改成 word 文本#include string? h> #include stdlib ? h> #include stdio. h> int m, si, s2;typedef struct unsigned int weight;unsigned int parent, lchild, rchild; HTNode, *HuffmanTree;/ 動(dòng)態(tài)分配數(shù)組存儲(chǔ)哈夫曼樹(shù)typedef char *HuffmanCode; / 動(dòng)態(tài)分配數(shù)組存儲(chǔ)哈夫曼編碼表void Select(HuffmanTree HT, int n) int i

2、, j;for (i = 1;i <= n;i+) if(!HTi. parent)si = i;break; for(j =i+1 ；j <= n;j+)if(!HTj. parent)s2 = j;break;for (i 二 1:i <= n;i+)if(HTslJ. weight>HTi. weight)&&(!HTi. parent)&&(s2!=i)sl=i; for(j = 1； j <=n;j+)if(HTs2. weight>HTj. weight)&&(!HTj. parent)&&

3、amp;(si!=j)s2=j; void HuffmanCoding(HuffmanTree &HT, HuffmanCode HC, int *w, int n) / 算法 6. 13/ w存放n個(gè)字符的權(quán)值(均0),構(gòu)造哈夫曼樹(shù)HT,/ 并求出 n 個(gè)字符的哈夫曼編碼 HCint i, j； char *cd;int p；int cdlen;if (n<=l) return;m = 2 * n 1;HT = (HuffmanTree)malloc(m+1) * sizeof(HTNode); / 0 號(hào) 單元未用for (i 二 1; i 二 n; i+) / 初始化HTi

4、. weight=wilj;HTi. parent 二 0;HTi. lchild=0;HTi.rchild 二 0;for (i 二 n+1; i 二 m; i+) / 初始化HTi. weights;HT i.parent 二 0;HTi. lchild 二 0;HTi.rchild=0;puts( n哈夫曼樹(shù)的構(gòu)造過(guò)程如下所示：");printf ("HT初態(tài):n結(jié)點(diǎn) weight parent lchild rchild");for (i 二 1； i<=m; i+)printf (，n%4d%8d%8d%8d%8d/，, i, HTi. weigh

5、t,HTi. parent, HTLi. lchild, HTi. rchild); printf C 按任意 鍵，繼續(xù) .")；getchar ();for (i 二 n+1; i二 m; i+) / 建哈夫曼樹(shù)/在HT1. i-1中選擇pare nt為0且weight最小的兩個(gè)結(jié)點(diǎn)，/ 其序號(hào)分別為 si 和 s2。Select(HT, i-1):HTsl.parent = i:HTs2. parent = i:HTi. lchild = si;HTi. rchild = s2;HTi. weight = HTsl. weight + HTs2. weight; printf (

6、z/nselect: sl=%ds2=%dn", si, s2);printf C 結(jié)點(diǎn) weight parent lchild rchild"); for (j=l; j<=i ；j+)printf (n%4d%8d%8d%8d%8d > j, HTj. weight,HTj. parent, HTj. lchild, HTjJ. rchild);printf C按任意鍵，繼續(xù) .")；getchar ();/ 無(wú) 棧非遞歸遍歷哈夫曼樹(shù)，求哈夫曼編碼cd = (char *)malloc (n*sizeof (char) :/ 分配求編碼的匚作空間

7、p = m; cdlen =0;for (i 二 1;i二 m; +i)HTi. weight =0;while (p)if (HTpJ. weights) 左HTp. weight =1:if (HTp. lchild !=dlen 卄二'O' ;else if (HTp.rchild = 0)/ 遍歷哈夫曼樹(shù)時(shí)用作結(jié)點(diǎn)狀態(tài)標(biāo)志/ 向0) p = HTp. lchild; cdc / 登記葉子結(jié)點(diǎn)的字符的編碼HCpZ = (char *)malloc(cdlen+1) * sizeof(char): cdcdlen 二' 0' ; strcpy(HCpZ, c

8、d);/復(fù)制編碼 ( 串 ) else if (HTp.weight=l) / 向右HTp. weight =2;if (HTp. rchild !=0) p = HTp. rchild; cdcdlen 卄二 T' ; else / HTp.weight=2, 退回退到父結(jié)點(diǎn)，編碼長(zhǎng)度減1HTpl. weight =0; p = HTp. parent;cdlen;/ HuffmanCodingint main() HuffmanTree HT;HuffmanCode *HC;int *w, n, i;putsf 輸入結(jié)點(diǎn)數(shù)： ) ；scanf &n);getchar ();HC = (HuffmanCode *)malloc(n*sizeof(HuffmanCode);w = (int *)malloc(n*sizeof(int);printf ("輸入%d個(gè)結(jié)點(diǎn)的權(quán)值n", n);for(i = 0;i < n;i+) scanf("%d", &wij);getchar ();HuffmanCoding (HT, HC, w, n); put