赫夫曼编码的问题..谁来看看！

[Yoon_EunHae]

#include <iostream>
using namespace std;
#define N 20     /*待编码字符的个数，即树中叶结点的最大个数*/
#define M 2*N-1  /*树中总的结点数目*/

class Huffman{
    private:
        typedef struct{
            unsigned int weight;
            unsigned int parent,lchild,rchild;
        }HTNode;            //树的结构 
        HTNode *HT;            
        
        typedef struct{
            char data;     //待编码的字符
            int weight;    //字符的权值  
            char code[N];  //字符的编码
        }HTCode;           //编码表 
        HTCode *HC;
        char *cd;          //需要的编码空间
        int n; 
        
    public:
        Huffman();
        ~Huffman();
        void SetValue();   //设置字符数,和权值 
        void Select(int k,int &s1,int &s2); //选择parent为0且weight最小的2个结点
        void HuffmanCoding();  
};

Huffman::Huffman(){
    HT=new HTNode[N];
    HC=new HTCode[M];
    cd=new char[N];
    n=0;
}

Huffman::~Huffman(){
    delete []HT;
    delete []HC;
    delete []cd;
}

void Huffman::SetValue(){
    int i;
    cout<<"Input code number:  "<<endl;
    cin>>n;
    cout<<"Input "<<n<<" charactor:  "<<endl;
    for(i=0;i<n;++i)
        cin>>HC[i].data;
    cout<<"Input code weight:   "<<endl;
    for(i=0;i<n;++i)
        cin>>HC[i].weight;    
}

void Huffman::Select(int k,int &s1,int &s2){
    int i;
    for(i=0;i<k;++i)
    if(!HT[i].parent)
       s1=i;
    for(i=0;i<k;++i)
        if(!HT[i].parent&&HT[i].weight<HT[s1].weight)
           s1=i;
    for(i=0;i<k;++i)
        if(!HT[i].parent&&i!=s1)
           s2=i;
    for(i=0;i<k;++i)       
        if(!HT[i].parent&&HT[i].weight<HT[s2].weight)
           s2=i;
}

void Huffman::HuffmanCoding(){
    //构造赫夫曼树HT,求出n个字符的赫夫曼编码HC
    int i,m=0,s1=0,s2=0;
    m=2*n-1;
    for(i=0;i<m;++i)               //初始化赫夫曼树 
    {
        if(i<n)
        HT[i].weight=HC[i].weight;
        else
        HT[i].weight=0;
        HT[i].parent=HT[i].lchild=HT[i].rchild=0;
    }
    
    for(i=n;i<m;++i)           //构造赫夫曼树 
    {
        Select(i-1,s1,s2);
        HT[s1].parent=i;     HT[s2].parent=i;
        HT[i].lchild=s1;     HT[i].rchild=s2;
        HT[i].weight=HT[s1].weight+HT[s2].weight;
    }
    cout<<"\nHuffmanTree:  "<<endl;
    cout<<"weight\tparent\tlchild\trchild"<<endl;
    for(i=0;i<m;++i)
        cout<<HT[i].weight<<"\t"<<HT[i].parent
            <<"\t"<<HT[i].lchild<<"\t"<<HT[i].rchild<<endl;
    cout<<endl;
    
   /* cd[n-1]='\0';
    int c=0,f=0,start=0;
    for(i=0;i<n;++i)              //逐个求赫夫曼编码 
    {
        start=n-1;                //编码结束符下标 
        for(c=i,f=HT[i].parent;f;c=f,f=HT[f].parent)//从叶子到根结点求编码
        if(HT[f].lchild==c-1)  
           cd[--start]='0';//左分支0 
           else
              cd[--start]='1'; //右分支1 
        strcpy(HC[i].code,&cd[start]);
    }
    
    for(i=0;i<n;++i)           
        cout<<HC[i].data<<" --- "<<HC[i].code<<endl;
        */
}
    
int main(){
    Huffman h;
    h.SetValue();
    h.HuffmanCoding();
    
    system("pause");
    return 0;
}
     

构造赫夫曼树那部分有问题 e ..
今天初学 哎

[Yoon_EunHae]

顶起来！

[K_s_G]

[Quote=引用 1 楼 Yoon_EunHae 的回复:]

顶起来！
[/Quote]

[Yoon_EunHae]

for(i=0;i<k;++i)
if(!HT[i].parent&&HT[i].weight<HT[s2].weight)
s2=i;

看到了一个错的
for(i=0;i<k;++i)
if(!HT[i].parent&&HT[i].weight<HT[s2].weight&&i!=s1)
s2=i;

[Yoon_EunHae]

顶！

[chuengchuenghq]

哪里不对？？

[ddddfbb]

...
时间太长了 忘记赫夫曼编码是怎么回事了

[疯魔症]

学习

[Yoon_EunHae]

问题已经自己解决了
分就给第一个回的人吧