<rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:trackback="http://madskills.com/public/xml/rss/module/trackback/" xmlns:wfw="http://wellformedweb.org/CommentAPI/" xmlns:slash="http://purl.org/rss/1.0/modules/slash/"><channel><title>Suminchen的专栏</title><link>http://blog.csdn.net/suminchen/</link><description /><dc:language>zh-CN</dc:language><lastUpdateTime>Wed, 16 Jan 2008 21:45:09 GMT</lastUpdateTime><ttl>60</ttl><item><dc:creator>Suminchen</dc:creator><title>KMP算法中next和nextval数组的计算方法</title><link>http://blog.csdn.net/Suminchen/archive/2008/01/16/2047546.aspx</link><pubDate>Wed, 16 Jan 2008 21:45:00 GMT</pubDate><guid>http://blog.csdn.net/Suminchen/archive/2008/01/16/2047546.aspx</guid><wfw:comment>http://blog.csdn.net/suminchen/comments/2047546.aspx</wfw:comment><comments>http://blog.csdn.net/Suminchen/archive/2008/01/16/2047546.aspx#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://blog.csdn.net/suminchen/comments/commentRss/2047546.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=2047546</trackback:ping><description>用一个实例描述KMP算法的next和nextval的求解，还有匹配过程&lt;img src ="http://blog.csdn.net/suminchen/aggbug/2047546.aspx" width = "1" height = "1" /&gt;</description></item></channel></rss>