﻿<?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++博客-jake1036-最新评论</title><link>http://www.cppblog.com/jake1036/CommentsRSS.aspx</link><description /><language>zh-cn</language><pubDate>Tue, 25 Oct 2011 01:59:05 GMT</pubDate><lastBuildDate>Tue, 25 Oct 2011 01:59:05 GMT</lastBuildDate><generator>cnblogs</generator><item><title>re: larbin源码分析(九) NamedSite站点的抽象类</title><link>http://www.cppblog.com/jake1036/archive/2011/10/16/148609.html#158496</link><dc:creator>koma</dc:creator><author>koma</author><pubDate>Sun, 16 Oct 2011 14:46:00 GMT</pubDate><guid>http://www.cppblog.com/jake1036/archive/2011/10/16/148609.html#158496</guid><description><![CDATA[你好，怎么没有第八部分呢，从（七）一下子到（九）了<img src ="http://www.cppblog.com/jake1036/aggbug/158496.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/jake1036/" target="_blank">koma</a> 2011-10-16 22:46 <a href="http://www.cppblog.com/jake1036/archive/2011/10/16/148609.html#158496#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 动态规划法-----最长增序子序列(非连续)</title><link>http://www.cppblog.com/jake1036/archive/2011/08/20/144727.html#153970</link><dc:creator> 杜明</dc:creator><author> 杜明</author><pubDate>Sat, 20 Aug 2011 09:47:00 GMT</pubDate><guid>http://www.cppblog.com/jake1036/archive/2011/08/20/144727.html#153970</guid><description><![CDATA[  我的垃圾博客就怕误人子弟，我都是很随意的写的。<br>  <a target="_new" href="http://blog.csdn.net/v_JULY_v/">http://blog.csdn.net/v_JULY_v/</a> <br>  这个网址是csdn上一个大牛写的，非常好。各种算法还有分析。推荐你看看。<img src ="http://www.cppblog.com/jake1036/aggbug/153970.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/jake1036/" target="_blank"> 杜明</a> 2011-08-20 17:47 <a href="http://www.cppblog.com/jake1036/archive/2011/08/20/144727.html#153970#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 动态规划法-----最长增序子序列(非连续)</title><link>http://www.cppblog.com/jake1036/archive/2011/08/20/144727.html#153969</link><dc:creator> 杜明</dc:creator><author> 杜明</author><pubDate>Sat, 20 Aug 2011 09:46:00 GMT</pubDate><guid>http://www.cppblog.com/jake1036/archive/2011/08/20/144727.html#153969</guid><description><![CDATA[@wangyan<br>  我的垃圾博客就怕误人子弟，我都是很随意的写的。<br>  <a target="_new" href="http://blog.csdn.net/v_JULY_v/">http://blog.csdn.net/v_JULY_v/</a> <br>  这个网址是csdn上一个大牛写的，非常好。各种算法还有分析。推荐你看看。<img src ="http://www.cppblog.com/jake1036/aggbug/153969.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/jake1036/" target="_blank"> 杜明</a> 2011-08-20 17:46 <a href="http://www.cppblog.com/jake1036/archive/2011/08/20/144727.html#153969#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 面试100 34找出数组中唯一出现一次的两个数字</title><link>http://www.cppblog.com/jake1036/archive/2011/08/16/146881.html#153569</link><dc:creator>aa</dc:creator><author>aa</author><pubDate>Tue, 16 Aug 2011 08:14:00 GMT</pubDate><guid>http://www.cppblog.com/jake1036/archive/2011/08/16/146881.html#153569</guid><description><![CDATA[@jince<br>这还要说么？<img src ="http://www.cppblog.com/jake1036/aggbug/153569.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/jake1036/" target="_blank">aa</a> 2011-08-16 16:14 <a href="http://www.cppblog.com/jake1036/archive/2011/08/16/146881.html#153569#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 动态规划法-----最长增序子序列(非连续)</title><link>http://www.cppblog.com/jake1036/archive/2011/08/10/144727.html#152964</link><dc:creator>wangyan</dc:creator><author>wangyan</author><pubDate>Wed, 10 Aug 2011 09:14:00 GMT</pubDate><guid>http://www.cppblog.com/jake1036/archive/2011/08/10/144727.html#152964</guid><description><![CDATA[读师兄博客受益匪浅。。<br>PS：我觉得if(max == 0)<br>打印的时候应当改为if（max==P[max]）<br>不然的话，若增序列不是从第一个开始，比如100 1 2 3 4，就会死循环。<img src ="http://www.cppblog.com/jake1036/aggbug/152964.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/jake1036/" target="_blank">wangyan</a> 2011-08-10 17:14 <a href="http://www.cppblog.com/jake1036/archive/2011/08/10/144727.html#152964#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 2011-5-7百度实习生笔试[未登录]</title><link>http://www.cppblog.com/jake1036/archive/2011/06/13/145938.html#148572</link><dc:creator>MU</dc:creator><author>MU</author><pubDate>Mon, 13 Jun 2011 02:52:00 GMT</pubDate><guid>http://www.cppblog.com/jake1036/archive/2011/06/13/145938.html#148572</guid><description><![CDATA[有没有去2011百度实习的同学啊 加群89864538<img src ="http://www.cppblog.com/jake1036/aggbug/148572.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/jake1036/" target="_blank">MU</a> 2011-06-13 10:52 <a href="http://www.cppblog.com/jake1036/archive/2011/06/13/145938.html#148572#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 面试100 34找出数组中唯一出现一次的两个数字</title><link>http://www.cppblog.com/jake1036/archive/2011/05/22/146881.html#146930</link><dc:creator>jince</dc:creator><author>jince</author><pubDate>Sun, 22 May 2011 09:49:00 GMT</pubDate><guid>http://www.cppblog.com/jake1036/archive/2011/05/22/146881.html#146930</guid><description><![CDATA[解决方案说清楚一点，谁和谁异或？什么两个数组，这能看么？大半在猜测你的说的话！<img src ="http://www.cppblog.com/jake1036/aggbug/146930.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/jake1036/" target="_blank">jince</a> 2011-05-22 17:49 <a href="http://www.cppblog.com/jake1036/archive/2011/05/22/146881.html#146930#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 2011-4-16 淘宝实习生面试总结</title><link>http://www.cppblog.com/jake1036/archive/2011/04/25/144374.html#144980</link><dc:creator>熊猫</dc:creator><author>熊猫</author><pubDate>Mon, 25 Apr 2011 11:16:00 GMT</pubDate><guid>http://www.cppblog.com/jake1036/archive/2011/04/25/144374.html#144980</guid><description><![CDATA[怎么我还要到公司去进行第三面，你两面就通过了啊？<img src ="http://www.cppblog.com/jake1036/aggbug/144980.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/jake1036/" target="_blank">熊猫</a> 2011-04-25 19:16 <a href="http://www.cppblog.com/jake1036/archive/2011/04/25/144374.html#144980#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 2011-4-16 淘宝实习生面试总结</title><link>http://www.cppblog.com/jake1036/archive/2011/04/21/144374.html#144738</link><dc:creator>安静</dc:creator><author>安静</author><pubDate>Thu, 21 Apr 2011 09:06:00 GMT</pubDate><guid>http://www.cppblog.com/jake1036/archive/2011/04/21/144374.html#144738</guid><description><![CDATA[感谢lz的总结，<br>你面的是研发吧。<br>我明天要面淘宝的测试开发工程师。不知道面试问题会不会贴近你的。<br>再次感谢~<img src ="http://www.cppblog.com/jake1036/aggbug/144738.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/jake1036/" target="_blank">安静</a> 2011-04-21 17:06 <a href="http://www.cppblog.com/jake1036/archive/2011/04/21/144374.html#144738#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 2011-4-16 淘宝实习生面试总结[未登录]</title><link>http://www.cppblog.com/jake1036/archive/2011/04/19/144374.html#144573</link><dc:creator>codekitten</dc:creator><author>codekitten</author><pubDate>Tue, 19 Apr 2011 11:45:00 GMT</pubDate><guid>http://www.cppblog.com/jake1036/archive/2011/04/19/144374.html#144573</guid><description><![CDATA[总。。。神。。。特来膜拜。。。恭喜恭喜<img src ="http://www.cppblog.com/jake1036/aggbug/144573.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/jake1036/" target="_blank">codekitten</a> 2011-04-19 19:45 <a href="http://www.cppblog.com/jake1036/archive/2011/04/19/144374.html#144573#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>