- 博客(0)
- 资源 (4)
空空如也
Huffman编/译码器 实验报告
void main(){
//HuffmanTree T;
//HuffmanCode hc;
/*char*str[]={" ,"A","B","C","D","E","F","G","H","I","J","K","L","M","N","O","P","Q","R","S","T","U","V","W","X","Y","Z"};
int w[]={186,64,13,22,32,103,21,15,47,57,1,5,32,20,57,63,15,1,48,51,80,23,8,18,1,16,1};
for(i=1;i<=n;i++){
strcpy(T[i].data,str[i]);
T[i].weight=w[i];
}*/
Initialization();
int k;
while(1){
cout<<"编码按1:"<<endl<<"译码按2:"<<endl<<"退出按3:"<<endl;
cin>>k;
if(k==3)break;
switch(k){
case 1:
cout<<"请输入字符"<<endl;
//cout<<HC['B'-63]<<endl;
char string[80];
gets(string);
int j;
for(j=0;string[j]!='\0';j++){
if(string[j]==' ')cout<<HC[1];
else
cout<<HC[string[j]-63];
};
break;
case 2:
cout<<"请输入需要翻译的code(少于100个字符)"<<endl;
char code[100];
gets(code);
//for(i=1,f=HT[i].parent;f=0;f=HT[i].parent);
int f=53;
//int i;
j=0;
while(*(code+j)){
if(HT[f].lchild&&*(code+j)=='0'){
f=HT[f].lchild;
//cout<<f<<endl;
}
if(HT[f].rchild&&*(code+j)=='1'){
f=HT[f].rchild;
}
if(!HT[f].rchild){
//cout<<f<<"\t"<<HT[f].lchild<<endl;
cout<<HT[f].data;
f=53;
}
j++;
}
cout<<endl;
break;
}
}
}
2011-02-19
约瑟夫环 实验报告 严蔚敏版
数据结构 实验报告 严蔚敏版
主函数
void main(){
LinkList *create(int n);//声明此函数
void print(LinkList *L); //声明打印函数
LinkList *L; //定义一个表
int n;
printf("请输入人数即n值");
scanf("%d",&n); //输入人数值
L= create(n); //构建单链表。
print(L); //打印出列顺序
}
2011-02-19
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人