﻿<?xml version="1.0" encoding="utf-8" standalone="yes"?><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>C++博客-Apollo Fang's Blog-随笔分类-Algorithm</title><link>http://www.cppblog.com/scorpio/category/18377.html</link><description /><language>zh-cn</language><lastBuildDate>Thu, 03 May 2012 16:26:45 GMT</lastBuildDate><pubDate>Thu, 03 May 2012 16:26:45 GMT</pubDate><ttl>60</ttl><item><title>KMP(1)--KMP算法解析</title><link>http://www.cppblog.com/scorpio/archive/2012/01/07/162295.html</link><dc:creator>Apollo Fang</dc:creator><author>Apollo Fang</author><pubDate>Sat, 07 Jan 2012 06:35:00 GMT</pubDate><guid>http://www.cppblog.com/scorpio/archive/2012/01/07/162295.html</guid><wfw:comment>http://www.cppblog.com/scorpio/comments/162295.html</wfw:comment><comments>http://www.cppblog.com/scorpio/archive/2012/01/07/162295.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/scorpio/comments/commentRss/162295.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/scorpio/services/trackbacks/162295.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: KMP(1)--KMP算法解析1.&nbsp;普通字符串匹配BF算法假设S串为原始串,&nbsp;T串为目标串.&nbsp;且S串匹配到i位置,&nbsp;T串匹配到j位置.在BF算法中,&nbsp;如果当前字符匹配成功,&nbsp;(即S[i+j]&nbsp;==&nbsp;T[j])&nbsp;令j++,&nbsp;继续匹配下一个字符;&nbsp;如果失配,&nbsp;(即S[i+j]&nbs...&nbsp;&nbsp;<a href='http://www.cppblog.com/scorpio/archive/2012/01/07/162295.html'>阅读全文</a><img src ="http://www.cppblog.com/scorpio/aggbug/162295.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/scorpio/" target="_blank">Apollo Fang</a> 2012-01-07 14:35 <a href="http://www.cppblog.com/scorpio/archive/2012/01/07/162295.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>