锘??xml version="1.0" encoding="utf-8" standalone="yes"?>精品久久久久久久久久中文字幕,亚洲天堂久久久,亚洲av伊人久久综合密臀性色http://www.shnenglu.com/Marcky/archive/2009/09/28/97474.htmlMarckyMarckyMon, 28 Sep 2009 09:49:00 GMThttp://www.shnenglu.com/Marcky/archive/2009/09/28/97474.htmlhttp://www.shnenglu.com/Marcky/comments/97474.htmlhttp://www.shnenglu.com/Marcky/archive/2009/09/28/97474.html#Feedback0http://www.shnenglu.com/Marcky/comments/commentRss/97474.htmlhttp://www.shnenglu.com/Marcky/services/trackbacks/97474.htmltypedef struct _HTNode {
    unsigned int weight;        /* 鏉冨?nbsp;*/
    unsigned int parent;        /* 鐖惰妭鐐圭儲寮?nbsp;*/
    unsigned int lchild;        /* 宸﹀瀛愮儲寮?nbsp;*/
    unsigned int rchild;        /* 鍙沖瀛愮儲寮?nbsp;*/
} HTNode, *HuffmanTree;         /* 鍔ㄦ佸垎閰嶆暟緇勫瓨鍌ㄥ搱澶浖鏍?nbsp;*/

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

/* 浠巋t鐨?锝瀗鐨勮妭鐐逛腑鎵懼嚭鏉冨兼渶灝忕殑涓や釜鑺傜偣錛屽垎鍒瓨浜巗1, 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錛屼笖鏉冨兼渶灝忕殑涓や釜鑺傜偣浣嶇疆錛屽垎鍒瓨浜巗1, 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鎸囧悜榪欓鍝堝か鏇兼爲 */
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鐨勭埗浜蹭負i */
        (*ht_ptr + s1)->parent = i;
        (*ht_ptr + s2)->parent = i;
        /* 璁劇疆i鐨勫乏瀛╁瓙涓簊1, 鍙沖瀛愪負s2 */
        (*ht_ptr + i)->lchild = s1;
        (*ht_ptr + i)->rchild = s2;
        /* 璁劇疆i鐨勬潈鍊間負s1, s2涔嬪拰 */
        (*ht_ptr + i)->weight = (*ht_ptr + s1)->weight + (*ht_ptr + s2)->weight;
    }
}

/* 瀵筯t_ptr瀛樺偍鐨勫搱澶浖鏍戠殑n涓彾瀛愯妭鐐硅繘琛屽搱澶浖緙栫爜 */
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;                                 /* 鐖惰妭鐐逛負0鏃跺強鍒拌揪浜嗘牴鑺傜偣 */
             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 鍙戣〃璇勮
]]>浜屽弶鏍戠殑鍒涘緩鍙婇亶鍘嗭紙閫掑綊浠ｇ爜錛?/title><link>http://www.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://www.shnenglu.com/Marcky/archive/2009/09/24/97173.html</guid><wfw:comment>http://www.shnenglu.com/Marcky/comments/97173.html</wfw:comment><comments>http://www.shnenglu.com/Marcky/archive/2009/09/24/97173.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.shnenglu.com/Marcky/comments/commentRss/97173.html</wfw:commentRss><trackback:ping>http://www.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;">鎸夊厛搴忔搴忚緭鍏ヤ簩鍙夋爲鑺傜偣鐨勫鹼紝絀烘牸琛ㄧず絀烘爲銆?/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;">鏋勯犲乏瀛愭爲</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;">鏋勯犲彸瀛愭爲</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://www.shnenglu.com/Marcky/aggbug/97173.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.shnenglu.com/Marcky/" target="_blank">Marcky</a> 2009-09-24 22:33 <a href="http://www.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://www.shnenglu.com/" title="精品视频久久久久">精品视频久久久久</a> <div class="friend-links"> </div> </div> </footer> <a href="http://www.kybdt.cn" target="_blank">av无码久久久久久不卡网站</a>| <a href="http://www.ha-jc.cn" target="_blank">久久亚洲视频</a>| <a href="http://www.bestorgazm.cn" target="_blank">人妻久久久一区二区三区</a>| <a href="http://www.gpuk.cn" target="_blank">久久久噜噜噜久久中文福利</a>| <a href="http://www.buy162.cn" target="_blank">久久精品中文闷骚内射</a>| <a href="http://www.xeyh.cn" target="_blank">伊人久久大香线焦综合四虎</a>| <a href="http://www.wcxkmm.cn" target="_blank">青青青青久久精品国产h久久精品五福影院1421 </a>| <a href="http://www.bailidujuan.cn" target="_blank">污污内射久久一区二区欧美日韩</a>| <a href="http://www.zgwlptw.cn" target="_blank">无码八A片人妻少妇久久</a>| <a href="http://www.bjnyjdxcj.cn" target="_blank">久久久久亚洲AV无码专区体验</a>| <a href="http://www.xxysw.com.cn" target="_blank">国产99久久久国产精品～～牛</a>| <a href="http://www.265zz.cn" target="_blank">蜜桃麻豆WWW久久囤产精品</a>| <a href="http://www.zhouyangla.cn" target="_blank">久久精品aⅴ无码中文字字幕不卡</a>| <a href="http://www.kmaxbm.cn" target="_blank">国产午夜精品理论片久久</a>| <a href="http://www.hwtk.net.cn" target="_blank">狠狠综合久久综合88亚洲</a>| <a href="http://www.ccguofeng.cn" target="_blank">亚洲国产精品久久久久婷婷软件</a>| <a href="http://www.urzf.cn" target="_blank">久久久久人妻一区二区三区</a>| <a href="http://www.gitscm.com.cn" target="_blank">久久伊人精品青青草原高清</a>| <a href="http://www.wushuichulisb.cn" target="_blank">国产精品久久久香蕉</a>| <a href="http://www.hnxxzw.cn" target="_blank">久久国产精品视频</a>| <a href="http://www.uukibu.cn" target="_blank">99久久国语露脸精品国产</a>| <a href="http://www.bjxcst.cn" target="_blank">久久久久亚洲AV无码观看</a>| <a href="http://www.99yingyuan.cn" target="_blank">久久久亚洲精品蜜桃臀</a>| <a href="http://www.r7c1.cn" target="_blank">亚洲国产精品久久久久网站</a>| <a href="http://www.3171unp.cn" target="_blank">乱亲女H秽乱长久久久</a>| <a href="http://www.blt5.cn" target="_blank">久久免费视频1</a>| <a href="http://www.gd-jk.cn" target="_blank">国产精品99久久久精品无码</a>| <a href="http://www.e-li.cn" target="_blank">99久久人人爽亚洲精品美女</a>| <a href="http://www.fengjinl.cn" target="_blank">国产情侣久久久久aⅴ免费</a>| <a href="http://www.xcfsfl.cn" target="_blank">中文字幕久久久久人妻</a>| <a href="http://www.88crm.cn" target="_blank">亚洲AV伊人久久青青草原</a>| <a href="http://www.zheibvgsz.cn" target="_blank">久久精品国产99国产精品</a>| <a href="http://www.kmkiddieedu.cn" target="_blank">久久久九九有精品国产</a>| <a href="http://www.vstmall.com.cn" target="_blank">AV无码久久久久不卡网站下载</a>| <a href="http://www.loreng.cn" target="_blank">无码AV中文字幕久久专区</a>| <a href="http://www.sanda8.com.cn" target="_blank">欧美精品乱码99久久蜜桃</a>| <a href="http://www.jrlxcc.cn" target="_blank">久久人妻无码中文字幕</a>| <a href="http://www.gzquanjing.cn" target="_blank">一本久久综合亚洲鲁鲁五月天</a>| <a href="http://www.qq-info.cn" target="_blank">久久夜色撩人精品国产</a>| <a href="http://www.945ba.cn" target="_blank">人人狠狠综合久久亚洲</a>| <a href="http://www.lordswar.cn" target="_blank">亚洲精品国产自在久久</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>