哈夫曼树中,树的带权路径长度的含义是各个字符的码长与其出现的此时的乘积和,
也就是电文的代码总长,所以采用哈夫曼树构造的编码是一种能使电文代码总长最短的
不等长编码。-Huffman tree. tree with the right path length is the meaning of the various characters code length of time with the product and, is the message code chief Therefore, the tree structure used Huffman coding can be a code message from the chief of the shortest length coding.
SHOW FULL COLUMNS FROM `jrk_downrecords` [ RunTime:0.001211s ]
SELECT `a`.`aid`,`a`.`title`,`a`.`create_time`,`m`.`username` FROM `jrk_downrecords` `a` INNER JOIN `jrk_member` `m` ON `a`.`uid`=`m`.`id` WHERE `a`.`status` = 1 GROUP BY `a`.`aid` ORDER BY `a`.`create_time` DESC LIMIT 10 [ RunTime:0.101088s ]
SHOW FULL COLUMNS FROM `jrk_tagrecords` [ RunTime:0.001168s ]
SELECT * FROM `jrk_tagrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 20 [ RunTime:0.001932s ]
SHOW FULL COLUMNS FROM `jrk_member` [ RunTime:0.001149s ]
SELECT `id`,`username`,`userhead`,`usertime` FROM `jrk_member` WHERE `status` = 1 ORDER BY `usertime` DESC LIMIT 10 [ RunTime:0.003594s ]
SHOW FULL COLUMNS FROM `jrk_searchrecords` [ RunTime:0.000979s ]
SELECT * FROM `jrk_searchrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 5 [ RunTime:0.003170s ]
SELECT aid,title,count(aid) as c FROM `jrk_downrecords` GROUP BY `aid` ORDER BY `c` DESC LIMIT 10 [ RunTime:0.014429s ]
SHOW FULL COLUMNS FROM `jrk_articles` [ RunTime:0.001223s ]
UPDATE `jrk_articles` SET `hits` = 1 WHERE `id` = 242590 [ RunTime:0.001576s ]
