<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[啊门啊前一颗葡萄树]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/nailsnail</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; nailsnail]]></copyright><item><title><![CDATA[gzip内幕]]></title><link>https://blog.youkuaiyun.com/nailsnail/article/details/5923758</link><guid>https://blog.youkuaiyun.com/nailsnail/article/details/5923758</guid><author>nailsnail</author><pubDate>Wed, 06 Oct 2010 15:29:00 +0800</pubDate><description><![CDATA[<br />轮廓<br />        gzip压缩的核心思想有两个，一是指代重复的内容，二是哈夫曼编码。指代重复内容，就是把重复出现的内容用二元组（distance，length）替代。distance是指相互匹配的两块内容之间的距离，length是指匹配的长度。完成了指代重复内
容的工作后，原始数据就被分成了三类：literal（没被匹配的字节)、distance和length
，接下来就对它们进行哈夫曼编码了。最后把输入文件的
编码发送到压缩文件中就可以了。<br /><br /><br /]]></description><category></category></item><item><title><![CDATA[《编程之美》“程序改错”一文之我见]]></title><link>https://blog.youkuaiyun.com/nailsnail/article/details/5922602</link><guid>https://blog.youkuaiyun.com/nailsnail/article/details/5922602</guid><author>nailsnail</author><pubDate>Tue, 05 Oct 2010 16:52:00 +0800</pubDate><description><![CDATA[      原文的大意是这样的，要求写一个二分查找算法，并且当要查找的数出现不止一次时，返回最后那个数的下标。然后给你一段有错的代码，请你改。]]></description><category></category></item></channel></rss>