// huffman_code.cpp : 定义控制台应用程序的入口点。
//
#include "stdafx.h"
#include <string>
#include "sstream"
#include <iostream>
using namespace std;
//定义单链表节点用于频数统计
typedef struct linknode *p;
typedef struct linknode
{
string s;
int value = 1;
p next;
}linknode, *link;
//定义树网单节点用于求解哈弗曼树(树网的定义见笔记)
typedef struct treenode *Ptotree;
typedef struct treenode
{
string s;
int value;
Ptotree left;
Ptotree right;
}treenode, *tree;
typedef struct treenetnode *PtoNode;
typedef struct treenetnode
{
PtoNode next;
tree root;
}treenetnode, *treenet;
//定义一个链表用于存储哈弗曼编码表
typedef struct codenode *Ptocode;
typedef struct codenode
{
string s1;//字符
string s2;//字符编码
Ptocode next;
}codenode, *code;
//函数声明
link count(string ss);
tree build_tree(link c);
void read(tree root, code list, string str);
string haffman_code(string ss);
int _tmain(int argc, _TCHAR* argv[])
{
cout << "请输入字符串:";
string s;
cin >> s;
string s_back;
s_back=haffman_code(s);
cout << "打印字符串编码:";
cout << s_back << endl;
return 0;
}
//统计字符串的各个字符的频数
link count(string ss)
{
link counthead = new linknode;
counthead-&g
//
#include "stdafx.h"
#include <string>
#include "sstream"
#include <iostream>
using namespace std;
//定义单链表节点用于频数统计
typedef struct linknode *p;
typedef struct linknode
{
string s;
int value = 1;
p next;
}linknode, *link;
//定义树网单节点用于求解哈弗曼树(树网的定义见笔记)
typedef struct treenode *Ptotree;
typedef struct treenode
{
string s;
int value;
Ptotree left;
Ptotree right;
}treenode, *tree;
typedef struct treenetnode *PtoNode;
typedef struct treenetnode
{
PtoNode next;
tree root;
}treenetnode, *treenet;
//定义一个链表用于存储哈弗曼编码表
typedef struct codenode *Ptocode;
typedef struct codenode
{
string s1;//字符
string s2;//字符编码
Ptocode next;
}codenode, *code;
//函数声明
link count(string ss);
tree build_tree(link c);
void read(tree root, code list, string str);
string haffman_code(string ss);
int _tmain(int argc, _TCHAR* argv[])
{
cout << "请输入字符串:";
string s;
cin >> s;
string s_back;
s_back=haffman_code(s);
cout << "打印字符串编码:";
cout << s_back << endl;
return 0;
}
//统计字符串的各个字符的频数
link count(string ss)
{
link counthead = new linknode;
counthead-&g