锘??xml version="1.0" encoding="utf-8" standalone="yes"?>精品免费久久久久久久,精品人妻久久久久久888,久久久久久免费一区二区三区http://m.shnenglu.com/Marcky/archive/2009/09/28/97474.htmlMarckyMarckyMon, 28 Sep 2009 09:49:00 GMThttp://m.shnenglu.com/Marcky/archive/2009/09/28/97474.htmlhttp://m.shnenglu.com/Marcky/comments/97474.htmlhttp://m.shnenglu.com/Marcky/archive/2009/09/28/97474.html#Feedback0http://m.shnenglu.com/Marcky/comments/commentRss/97474.htmlhttp://m.shnenglu.com/Marcky/services/trackbacks/97474.htmltypedef struct _HTNode {
    unsigned int weight;        /* 鏉冨?nbsp;*/
    unsigned int parent;        /* 鐖惰妭鐐圭儲(chǔ)寮?nbsp;*/
    unsigned int lchild;        /* 宸﹀瀛愮儲(chǔ)寮?nbsp;*/
    unsigned int rchild;        /* 鍙沖瀛愮儲(chǔ)寮?nbsp;*/
} HTNode, *HuffmanTree;         /* 鍔ㄦ佸垎閰嶆暟緇勫瓨鍌ㄥ搱澶浖鏍?nbsp;*/

typedef char **HuffmanCode;     /* 鍔ㄦ佸垎閰嶆暟緇勫瓨鍌ㄥ搱澶浖緙栫爜琛?nbsp;*/

/* 浠巋t鐨?锝瀗鐨勮妭鐐逛腑鎵懼嚭鏉冨兼渶灝忕殑涓や釜鑺傜偣錛屽垎鍒瓨?shù)簬s1, s2涓?nbsp;*/
void Select(HuffmanTree ht, int n, int *s1, int *s2)
{
    int i;

    *s1 = 0;
    *s2 = 0;
    /*璁劇疆s1, s2鍒板紑濮嬩袱涓猵arent絳変簬0鐨勮妭鐐逛綅緗?/span>*/
    for (i = 1; i <= n; ++i) {
        if (*s1 != 0 && *s2 != 0)
            break;
       
        if (ht[i].parent == 0)
            *s1 == 0 ? *s1 = i : *s2 = i;
    }
    /*鎵懼嚭ht涓璸arent絳変簬0錛屼笖鏉冨兼渶灝忕殑涓や釜鑺傜偣浣嶇疆錛屽垎鍒瓨?shù)簬s1, s2涓?/span>*/
    for ( ; i <= n; ++i) {
        if (ht[i].parent != 0) continue;

        if ( (ht[*s1].weight > ht[*s2].weight) && (ht[*s1].weight > ht[i].weight))
            *s1 = i;
        else if ( (ht[*s2].weight > ht[*s1].weight) && (ht[*s2].weight > ht[i].weight))
            *s2 = i;
    }
}

/* 閫氳繃w瀛樺偍鐨刵涓潈鍊鹼紝鏉ュ垱寤轟竴棰楀搱澶浖鏍? ht_ptr鎸囧悜榪欓鍝堝か鏇兼爲(wèi) */
void CreateHuffmanTree(HuffmanTree *ht_ptr, int *w, int n)
{
    int m;
    int i;
    int s1, s2;
    HuffmanTree p;
    
    if (n <= 1) return;
    m = 2 * n - 1;              /* n涓瓧絎︼紝闇瑕?n-1涓┖闂存潵瀛樺偍鏁撮huffman tree */
    *ht_ptr = (HuffmanTree)malloc( (m + 1) * sizeof(HTNode)); /* 0鍙峰崟鍏冧笉鐢?nbsp;*/

    for (p = *ht_ptr + 1, i = 1; i <= n; ++i, ++p, ++w) { /* 鍒濆鍖栨暟緇勪腑鍓峮涓崟鍏冨瓨鍌ㄧ殑瀛楃 */
        p->weight = *w;
        p->parent = 0;
        p->lchild = 0;
        p->rchild = 0;
    }
    for ( ; i <= m; ++i, ++p) { /* 鍒濆鍖栨暟緇勪腑鍓╀綑鐨勫崟鍏?nbsp;*/
        p->weight = 0;
        p->parent = 0;
        p->lchild = 0;
        p->rchild = 0;
    }

    for (i = n + 1; i <= m; ++i) {
        Select(*ht_ptr, i - 1, &s1, &s2);
        /* 璁劇疆s1, s2鐨勭埗浜蹭負(fù)i */
        (*ht_ptr + s1)->parent = i;
        (*ht_ptr + s2)->parent = i;
        /* 璁劇疆i鐨勫乏瀛╁瓙涓簊1, 鍙沖瀛愪負(fù)s2 */
        (*ht_ptr + i)->lchild = s1;
        (*ht_ptr + i)->rchild = s2;
        /* 璁劇疆i鐨勬潈鍊間負(fù)s1, s2涔嬪拰 */
        (*ht_ptr + i)->weight = (*ht_ptr + s1)->weight + (*ht_ptr + s2)->weight;
    }
}

/* 瀵筯t_ptr瀛樺偍鐨勫搱澶浖鏍?wèi)鐨刵涓彾瀛愯妭鐐硅繘琛屽搱澶浖緙栫爜 */
void HuffmanCoding(HuffmanTree *ht_ptr, HuffmanCode *hc_ptr, int n)
{
    int i;
    int start;
    char *cd = NULL;
    
    *hc_ptr = (HuffmanCode)malloc( (n + 1) * sizeof(char *));

    cd = (char *)malloc(n * sizeof(char));
    cd[n - 1] = '\0';

    for (i = 1; i <= n; ++i) {
        start = n - 1;

        int current, father;
        for (current = i, father = (*ht_ptr + i)->parent; /* 浠庡彾瀛愯妭鐐瑰紑濮嬶紝騫跺彇寰楃埗鑺傜偣father */
             father != 0;                                 /* 鐖惰妭鐐逛負(fù)0鏃跺強(qiáng)鍒拌揪浜?jiǎn)鏍硅妭鐐?nbsp;*/
             current = father, father = (*ht_ptr + father)->parent) { /* 閫愭笎鍚戞牴鑺傜偣闈犳嫝 */
            if ( (*ht_ptr + father)->lchild == current) /* 褰撳墠鑺傜偣涓哄乏瀛╁瓙 */
                cd[--start] = '0';
            else
                cd[--start] = '1';

        }

        *(*hc_ptr + i) = (char *)malloc( (n - start) * sizeof(char));
        strcpy(*(*hc_ptr +i), &cd[start]);
    }
    free(cd);
}


Marcky 2009-09-28 17:49 鍙戣〃璇勮
]]>浜屽弶鏍?wèi)鐨勫垱寰忓強(qiáng)閬嶅巻锛堥掑綊浠ｇ爜錛?/title><link>http://m.shnenglu.com/Marcky/archive/2009/09/24/97173.html</link><dc:creator>Marcky</dc:creator><author>Marcky</author><pubDate>Thu, 24 Sep 2009 14:33:00 GMT</pubDate><guid>http://m.shnenglu.com/Marcky/archive/2009/09/24/97173.html</guid><wfw:comment>http://m.shnenglu.com/Marcky/comments/97173.html</wfw:comment><comments>http://m.shnenglu.com/Marcky/archive/2009/09/24/97173.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://m.shnenglu.com/Marcky/comments/commentRss/97173.html</wfw:commentRss><trackback:ping>http://m.shnenglu.com/Marcky/services/trackbacks/97173.html</trackback:ping><description><![CDATA[<div style="border: 1px solid #cccccc; padding: 4px 5px 4px 4px; background-color: #eeeeee; font-size: 13px; width: 98%;"><!--<br><br>Code highlighting produced by Actipro CodeHighlighter (freeware)<br>http://www.CodeHighlighter.com/<br><br>--><span style="color: #0000ff;">typedef enum</span><span style="color: #000000;"> _STATUS {ERROR, OK} STATUS;<br><br>typedef </span><span style="color: #0000ff;">struct</span><span style="color: #000000;"> _BiTNode {<br>    </span><span style="color: #0000ff;">char</span><span style="color: #000000;"> data;<br>    </span><span style="color: #0000ff;">struct</span><span style="color: #000000;"> _BiTNode </span><span style="color: #000000;">*</span><span style="color: #000000;">lchild;<br>    </span><span style="color: #0000ff;">struct</span><span style="color: #000000;"> _BiTNode </span><span style="color: #000000;">*</span><span style="color: #000000;">rchild;<br>} BiTNode, </span><span style="color: #000000;">*</span><span style="color: #000000;">BiTree;<br><br></span><span style="color: #008000;">/*</span><span style="color: #008000;">鍒涘緩浜屽弶鏍?/span><span style="color: #008000;">*/</span><span style="color: #000000;"><br>STATUS CreateBiTree(BiTree </span><span style="color: #000000;">*</span><span style="color: #000000;">T)<br>{</span><span style="color: #008000;">/*</span><span style="color: #008000;">鎸夊厛搴忔搴忚緭鍏ヤ簩鍙夋爲(wèi)鑺傜偣鐨勫鹼紝絀烘牸琛ㄧず絀烘爲(wèi)銆?/span><span style="color: #008000;">*/</span><span style="color: #000000;"><br>    </span><span style="color: #0000ff;">char</span><span style="color: #000000;"> ch;<br>    <br>    scanf(</span><span style="color: #000000;">"</span><span style="color: #000000;">%c</span><span style="color: #000000;">"</span><span style="color: #000000;">, </span><span style="color: #000000;">&</span><span style="color: #000000;">ch);<br>    </span><span style="color: #0000ff;">if</span><span style="color: #000000;"> (ch </span><span style="color: #000000;">==</span><span style="color: #000000;"> </span><span style="color: #000000;">'</span><span style="color: #000000;"> </span><span style="color: #000000;">'</span><span style="color: #000000;">) { <br>        </span><span style="color: #000000;">*</span><span style="color: #000000;">T </span><span style="color: #000000;">=</span><span style="color: #000000;"> NULL;<br>    } </span><span style="color: #0000ff;">else</span><span style="color: #000000;"> {<br>        </span><span style="color: #0000ff;">if</span><span style="color: #000000;"> ( </span><span style="color: #000000;">!</span><span style="color: #000000;">(</span><span style="color: #000000;">*</span><span style="color: #000000;">T </span><span style="color: #000000;">=</span><span style="color: #000000;"> (BiTNode </span><span style="color: #000000;">*</span><span style="color: #000000;">)malloc(</span><span style="color: #0000ff;">sizeof</span><span style="color: #000000;">(BiTNode)))) exit(</span><span style="color: #000000;">-</span><span style="color: #000000;">1</span><span style="color: #000000;">);<br>        (</span><span style="color: #000000;">*</span><span style="color: #000000;">T)</span><span style="color: #000000;">-></span><span style="color: #000000;">data </span><span style="color: #000000;">=</span><span style="color: #000000;"> ch;                     </span><span style="color: #008000;">//</span><span style="color: #008000;">鐢熸垚鏍硅妭鐐?/span><span style="color: #008000;"><br></span><span style="color: #000000;">        CreateBiTree(</span><span style="color: #000000;">&</span><span style="color: #000000;">((</span><span style="color: #000000;">*</span><span style="color: #000000;">T)</span><span style="color: #000000;">-></span><span style="color: #000000;">lchild));       </span><span style="color: #008000;">//</span><span style="color: #008000;">鏋勯犲乏瀛愭爲(wèi)</span><span style="color: #008000;"><br></span><span style="color: #000000;">        CreateBiTree(</span><span style="color: #000000;">&</span><span style="color: #000000;">((</span><span style="color: #000000;">*</span><span style="color: #000000;">T)</span><span style="color: #000000;">-></span><span style="color: #000000;">rchild));       </span><span style="color: #008000;">//</span><span style="color: #008000;">鏋勯犲彸瀛愭爲(wèi)</span><span style="color: #008000;"><br></span><span style="color: #000000;">    }<br>    </span><span style="color: #0000ff;">return</span><span style="color: #000000;"> OK;<br>}<br><br></span><span style="color: #008000;">/*</span><span style="color: #008000;">涓簭閬嶅巻浜屽弶鏍?/span><span style="color: #008000;">*/</span><span style="color: #000000;"><br>STATUS InOrderTraverse(BiTree </span><span style="color: #000000;">*</span><span style="color: #000000;">T)<br>{<br>    </span><span style="color: #0000ff;">if</span><span style="color: #000000;"> (</span><span style="color: #000000;">*</span><span style="color: #000000;">T) {<br>        </span><span style="color: #0000ff;">if</span><span style="color: #000000;"> (InOrderTraverse(</span><span style="color: #000000;">&</span><span style="color: #000000;">((</span><span style="color: #000000;">*</span><span style="color: #000000;">T)</span><span style="color: #000000;">-></span><span style="color: #000000;">lchild)))<br>            printf(</span><span style="color: #000000;">"</span><span style="color: #000000;">%c </span><span style="color: #000000;">"</span><span style="color: #000000;">, (</span><span style="color: #000000;">*</span><span style="color: #000000;">T)</span><span style="color: #000000;">-></span><span style="color: #000000;">data);<br>            </span><span style="color: #0000ff;">if</span><span style="color: #000000;"> (InOrderTraverse(</span><span style="color: #000000;">&</span><span style="color: #000000;">((</span><span style="color: #000000;">*</span><span style="color: #000000;">T)</span><span style="color: #000000;">-></span><span style="color: #000000;">rchild)))<br>                </span><span style="color: #0000ff;">return</span><span style="color: #000000;"> OK;<br>        </span><span style="color: #0000ff;">return</span><span style="color: #000000;"> ERROR;<br>    } </span><span style="color: #0000ff;">else</span><span style="color: #000000;"> {<br>        </span><span style="color: #0000ff;">return</span><span style="color: #000000;"> OK;<br>    }<br>}</span></div> <br> <img src ="http://m.shnenglu.com/Marcky/aggbug/97173.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://m.shnenglu.com/Marcky/" target="_blank">Marcky</a> 2009-09-24 22:33 <a href="http://m.shnenglu.com/Marcky/archive/2009/09/24/97173.html#Feedback" target="_blank" style="text-decoration:none;">鍙戣〃璇勮</a></div>]]></description></item></channel></rss> <footer> <div class="friendship-link"> <p>感谢您访问我们的网站，您可能还对以下资源感兴趣：</p> <a href="http://m.shnenglu.com/" title="精品视频久久久久">精品视频久久久久</a> <div class="friend-links"> </div> </div> </footer> <a href="http://www.chizhou8.cn" target="_blank">日本精品久久久久影院日本</a>| <a href="http://www.idqs.cn" target="_blank">亚洲伊人久久大香线蕉综合图片</a>| <a href="http://www.hesiyu.cn" target="_blank">久久国产精品久久久</a>| <a href="http://www.odbeqi.cn" target="_blank">亚洲国产精品久久久久久</a>| <a href="http://www.enetbase.cn" target="_blank">久久精品国产精品亜洲毛片</a>| <a href="http://www.k6399.cn" target="_blank">久久精品中文字幕大胸</a>| <a href="http://www.txhyhf.cn" target="_blank">国产三级久久久精品麻豆三级 </a>| <a href="http://www.zaggaa.cn" target="_blank">久久久久国色AV免费观看</a>| <a href="http://www.dnn.org.cn" target="_blank">亚洲国产成人精品无码久久久久久综合 </a>| <a href="http://www.lnkbl.com.cn" target="_blank">久久精品国产精品亜洲毛片</a>| <a href="http://www.208dj.cn" target="_blank">亚洲精品国产字幕久久不卡</a>| <a href="http://www.b5ezt1.cn" target="_blank">久久精品一区二区</a>| <a href="http://www.chezhuangbao.cn" target="_blank">一本一道久久a久久精品综合</a>| <a href="http://www.aikandianying.cn" target="_blank">亚洲精品乱码久久久久久蜜桃图片</a>| <a href="http://www.63550.com.cn" target="_blank">久久99精品国产99久久</a>| <a href="http://www.292284.cn" target="_blank">亚洲伊人久久成综合人影院</a>| <a href="http://www.yefaa.cn" target="_blank">女人香蕉久久**毛片精品</a>| <a href="http://www.zey120.cn" target="_blank">中文字幕人妻色偷偷久久</a>| <a href="http://www.dishengbao.cn" target="_blank">久久av免费天堂小草播放</a>| <a href="http://www.sina458.cn" target="_blank">久久大香香蕉国产</a>| <a href="http://www.orange-cat.cn" target="_blank">色播久久人人爽人人爽人人片AV</a>| <a href="http://www.shuwangou.cn" target="_blank">麻豆精品久久久一区二区</a>| <a href="http://www.longfee.cn" target="_blank">亚洲精品无码久久一线</a>| <a href="http://www.x4565.cn" target="_blank">亚洲欧美另类日本久久国产真实乱对白 </a>| <a href="http://www.26zf.cn" target="_blank">精品国产乱码久久久久久1区2区</a>| <a href="http://www.evane.cn" target="_blank">香蕉99久久国产综合精品宅男自</a>| <a href="http://www.265z.cn" target="_blank">久久综合九色综合97_久久久</a>| <a href="http://www.yxwelding.com.cn" target="_blank">日产精品久久久一区二区</a>| <a href="http://www.japjoy.cn" target="_blank">亚洲七七久久精品中文国产</a>| <a href="http://www.whruide.cn" target="_blank">国产精品美女久久久免费</a>| <a href="http://www.lawyer010.cn" target="_blank">2021久久精品国产99国产精品</a>| <a href="http://www.gangniao.cn" target="_blank">久久精品国产日本波多野结衣 </a>| <a href="http://www.dt175.cn" target="_blank">人妻精品久久久久中文字幕69 </a>| <a href="http://www.2nder.cn" target="_blank">青草影院天堂男人久久</a>| <a href="http://www.wxpk10.cn" target="_blank">久久99免费视频</a>| <a href="http://www.2pt.com.cn" target="_blank">久久久久综合网久久</a>| <a href="http://www.pz25555.cn" target="_blank">潮喷大喷水系列无码久久精品 </a>| <a href="http://www.gmve.cn" target="_blank">国产三级精品久久</a>| <a href="http://www.air-ticket.cn" target="_blank">婷婷综合久久狠狠色99h</a>| <a href="http://www.kwig.cn" target="_blank">国产午夜精品久久久久九九</a>| <a href="http://www.665m.cn" target="_blank">久久久久国产亚洲AV麻豆</a>| <script> (function(){ var bp = document.createElement('script'); var curProtocol = window.location.protocol.split(':')[0]; if (curProtocol === 'https') { bp.src = 'https://zz.bdstatic.com/linksubmit/push.js'; } else { bp.src = 'http://push.zhanzhang.baidu.com/push.js'; } var s = document.getElementsByTagName("script")[0]; s.parentNode.insertBefore(bp, s); })(); </script> </body>