三国演义第65集:程序求教?<HUFFMAN>

来源：百度文库编辑：中科新闻网时间：2024/04/29 21:34:37

用一个程序完成一下两个功能：
1：用HUFFUMAN树给出HUFFMAN编码
2用下表给出的字符集和频度的实际统计数据建立HUFFMAN树，并实现以下报文的编码和译码：“THIS#PROGRAM#IS#MY#FAVORITE”。
字符：# A B C D E F G H I J K L M N O P K R S T U V W X Y Z
频度：186 64 13 22 32 103 21 15 47 57 1 5 32 20 57 63 15 1 48 51 20 23 8 18 1 16 1

兄弟急求忘各位仁兄帮忙啊最好用C或C++编译
刚开学老师让弄的都没怎么学过C++ 有点难度所以特请教各位了~~~不胜感激
兄弟，两个文件是怎么回事可以一块输入？i是一个程序还是两个程序，我一块输入了怎么有一个错误啊？

我以前做的，分两个文件，VC6 编译的，仅供参考，呵呵

======== 文件 1 ==========
#include <string.h>
#include <stdio.h>
#include "dlib.h"
#define MAX_NODE 1024
#define MAX_WEIGHT 4096
typedef struct HaffmanTreeNode
{
char ch, code[15];
int weight;
int parent, lchild, rchild;
}HTNode, *HaTree;
typedef struct
{
HTNode arr[MAX_NODE];
int total;
} HTree;
/* 统计字符出现的频率 */
int statistic_char(char *text, HTree *t)
{
int i, j;
int text_len = strlen(text);
t->total = 0;
for (i=0; i<text_len; i++)
{
for (j=0; j<t->total; j++)
if (t->arr[j].ch == text[i])
{
t->arr[j].weight ++;
break;
}
if (j==t->total)
{
t->arr[t->total].ch = text[i];
t->arr[t->total].weight = 1;
t->total ++;
}

}
printf("char frequence\n");
for (i=0; i<t->total; i++)
printf("'%c' %d\n", t->arr[i].ch, t->arr[i].weight);
printf("\n");
return t->total;
}
int create_htree(HTree *t)
{
int i;
int total_node = t->total * 2 - 1;
int min1, min2; /* 权最小的两个结点 */
int min1_i, min2_i; /* 权最小结点对应的编号 */
int leaves = t->total;
for (i=0; i<leaves; i++)
{
t->arr[i].parent = -1;
t->arr[i].rchild = -1;
t->arr[i].lchild = -1;
}
while (t->total < total_node)
{
min1 = min2 = MAX_WEIGHT;
for (i=0; i<t->total; i++)
{ /* 对每一个结点 */
if (t->arr[i].parent == -1 /* 结点没有被合并 */
&& t->arr[i].weight < min2)
{ /* 结点的权比最小权小 */
if (t->arr[i].weight < min1)
{ /* 如果它比最小的结点还小 */
min2_i = min1_i; min2 = min1;
min1_i = i; min1 = t->arr[i].weight;

}
else
{
min2_i = i; min2 = t->arr[i].weight;
}
}
}
t->arr[t->total].weight = min1 + min2;
t->arr[t->total].parent = -1;
t->arr[t->total].lchild = min1_i;
t->arr[t->total].rchild = min2_i;
t->arr[min1_i].parent = t->total;
t->arr[min2_i].parent = t->total;
t->arr[t->total].ch = ' ';
t->total ++;
}
return 0;
}
/* 对哈夫曼树进行编码 */
void coding(HTree *t, int head_i, char *code)
{
if ( head_i == -1) return;
if (t->arr[head_i].lchild == -1 && t->arr[head_i].rchild == -1)
{
strcpy(t->arr[head_i].code, code);
printf("'%c': %s\n", t->arr[head_i].ch, t->arr[head_i].code);
}
else
{
int len = strlen(code);
strcat(code, "0");
coding(t, t->arr[head_i].lchild, code);
code[len] = '1';
coding(t, t->arr[head_i].rchild, code);
code[len] = '\0';
}
}
/* 中序打印树 */
void print_htree_ldr(HTree *t, int head_i, int deep, int* path)
{
int i;
if (head_i == -1) return;
path[deep] = 0;
print_htree_ldr(t, t->arr[head_i].lchild, deep + 1, path);
if (deep) printf(" ");
for (i=1; i<deep; i++)
printf("%s", path[i]==path[i-1]?" ":"│ ");
int dir = path[i]==path[i-1];
if ( t->arr[head_i].lchild == -1 && t->arr[head_i].rchild == -1)
printf("%s—— %d '%c'\n", dir? "┌":"└",
t->arr[head_i].weight, t->arr[head_i].ch);
else if (head_i != t->total-1)
printf("%s—%02d┤\n", dir? "┌":"└", t->arr[head_i].weight);
else
printf(" %02d┤\n", t->arr[head_i].weight);
path[deep] = 1;
print_htree_ldr(t, t->arr[head_i].rchild, deep + 1, path);
}
/* 对字符进行编码 */
void code_string(char *text, HTree *t)
{
int i, j, text_len = strlen(text);
int n = 0;
for (i=0; i<text_len; i++)
{
char ch = text[i];
for (j=0; j<t->total; j++) if (ch == t->arr[j].ch)
{
printf("%s ", t->arr[j].code);
n += strlen(t->arr[j].code);
break;
}
}
printf("\n%d chars, Total len = %d\n", text_len, n);
}
int main(int argc, char* argv[])
{
HTree t;

//-----------------------------------------------------
printf("please input a letter string :\n");
char text[128];
scanf("%s",text);
//-----------------------------------------------------
char code[128] = "";
int path[16]={0};
statistic_char(text, &t);
create_htree(&t);
print_htree_ldr(&t, t.total-1, 0, path);
coding(&t, t.total-1, code);
code_string(text, &t);
pause();
return 0;
}
========= 文件 2 ==============
/* this file include some function
* which defined by myself can do
* some io and check operate
* creat time: 2003/09/27
*/

/* testp: to test whether a pointer
* is NULL,if it is NULL,program will
* exit,otherwise program will go on
*/

#ifndef _DLIB_H
#define _DLIB_H

#include <conio.h>
#include <iostream>
using namespace std;

template<class type>
void testp(type *p)
{
if(!p)
{
cout<<"no memery available,anykey to exit";
getch();
exit(1);
}
}

//the next function can clear screen

void clrscr()
{
system("cls");
}

void pause()
{
system("pause");
}
#endif

程序求教?<HUFFMAN> huffman编码器和译码器c 程序若已知n个字符的频率：f1<=f2<=......<=fn,试写构造他们的Huffman码的程序。求教：谭咏麟英文歌曲 <<Lorelei>>的英文歌词求教<<关于硬盘格式化问题>>? <求教>mp3打不开了? 关于<精灵复苏> 求教求教关于韩国<情书> <兄弟连>求教，帮帮我。。。。。 <求教>反库的问题