﻿<?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/category/15610.html</link><description /><language>zh-cn</language><lastBuildDate>Tue, 11 Oct 2011 03:31:48 GMT</lastBuildDate><pubDate>Tue, 11 Oct 2011 03:31:48 GMT</pubDate><ttl>60</ttl><item><title>9-24MTK一面二面</title><link>http://www.cppblog.com/jake1036/archive/2011/09/24/156710.html</link><dc:creator>kahn</dc:creator><author>kahn</author><pubDate>Sat, 24 Sep 2011 11:27:00 GMT</pubDate><guid>http://www.cppblog.com/jake1036/archive/2011/09/24/156710.html</guid><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: MTK面试总结&nbsp;&nbsp;<a href='http://www.cppblog.com/jake1036/archive/2011/09/24/156710.html'>阅读全文</a><img src ="http://www.cppblog.com/jake1036/aggbug/156710.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/jake1036/" target="_blank">kahn</a> 2011-09-24 19:27 <a href="http://www.cppblog.com/jake1036/archive/2011/09/24/156710.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>微软笔试总结</title><link>http://www.cppblog.com/jake1036/archive/2011/09/20/156360.html</link><dc:creator>kahn</dc:creator><author>kahn</author><pubDate>Tue, 20 Sep 2011 14:15:00 GMT</pubDate><guid>http://www.cppblog.com/jake1036/archive/2011/09/20/156360.html</guid><wfw:comment>http://www.cppblog.com/jake1036/comments/156360.html</wfw:comment><comments>http://www.cppblog.com/jake1036/archive/2011/09/20/156360.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/jake1036/comments/commentRss/156360.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/jake1036/services/trackbacks/156360.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: MS笔试&nbsp;&nbsp;<a href='http://www.cppblog.com/jake1036/archive/2011/09/20/156360.html'>阅读全文</a><img src ="http://www.cppblog.com/jake1036/aggbug/156360.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/jake1036/" target="_blank">kahn</a> 2011-09-20 22:15 <a href="http://www.cppblog.com/jake1036/archive/2011/09/20/156360.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>2011-09-07xx移动创业公司笔试题</title><link>http://www.cppblog.com/jake1036/archive/2011/09/09/155444.html</link><dc:creator>kahn</dc:creator><author>kahn</author><pubDate>Fri, 09 Sep 2011 05:56:00 GMT</pubDate><guid>http://www.cppblog.com/jake1036/archive/2011/09/09/155444.html</guid><wfw:comment>http://www.cppblog.com/jake1036/comments/155444.html</wfw:comment><comments>http://www.cppblog.com/jake1036/archive/2011/09/09/155444.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/jake1036/comments/commentRss/155444.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/jake1036/services/trackbacks/155444.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 09-07XX移动笔试题目整理&nbsp;&nbsp;<a href='http://www.cppblog.com/jake1036/archive/2011/09/09/155444.html'>阅读全文</a><img src ="http://www.cppblog.com/jake1036/aggbug/155444.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/jake1036/" target="_blank">kahn</a> 2011-09-09 13:56 <a href="http://www.cppblog.com/jake1036/archive/2011/09/09/155444.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>编程之美2.7 最大公约数</title><link>http://www.cppblog.com/jake1036/archive/2011/07/10/150583.html</link><dc:creator>kahn</dc:creator><author>kahn</author><pubDate>Sun, 10 Jul 2011 11:58:00 GMT</pubDate><guid>http://www.cppblog.com/jake1036/archive/2011/07/10/150583.html</guid><wfw:comment>http://www.cppblog.com/jake1036/comments/150583.html</wfw:comment><comments>http://www.cppblog.com/jake1036/archive/2011/07/10/150583.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/jake1036/comments/commentRss/150583.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/jake1036/services/trackbacks/150583.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 编程之美2.7求最大公约数&nbsp;&nbsp;<a href='http://www.cppblog.com/jake1036/archive/2011/07/10/150583.html'>阅读全文</a><img src ="http://www.cppblog.com/jake1036/aggbug/150583.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/jake1036/" target="_blank">kahn</a> 2011-07-10 19:58 <a href="http://www.cppblog.com/jake1036/archive/2011/07/10/150583.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>O(n)实现删除两个数组中的共同元素</title><link>http://www.cppblog.com/jake1036/archive/2011/07/01/149882.html</link><dc:creator>kahn</dc:creator><author>kahn</author><pubDate>Fri, 01 Jul 2011 02:54:00 GMT</pubDate><guid>http://www.cppblog.com/jake1036/archive/2011/07/01/149882.html</guid><wfw:comment>http://www.cppblog.com/jake1036/comments/149882.html</wfw:comment><comments>http://www.cppblog.com/jake1036/archive/2011/07/01/149882.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/jake1036/comments/commentRss/149882.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/jake1036/services/trackbacks/149882.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: o(n)时间内实现删除两个元素之间的交集&nbsp;&nbsp;<a href='http://www.cppblog.com/jake1036/archive/2011/07/01/149882.html'>阅读全文</a><img src ="http://www.cppblog.com/jake1036/aggbug/149882.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/jake1036/" target="_blank">kahn</a> 2011-07-01 10:54 <a href="http://www.cppblog.com/jake1036/archive/2011/07/01/149882.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>编程之美1.9(二) 高效率地安排会面</title><link>http://www.cppblog.com/jake1036/archive/2011/06/30/149815.html</link><dc:creator>kahn</dc:creator><author>kahn</author><pubDate>Thu, 30 Jun 2011 06:37:00 GMT</pubDate><guid>http://www.cppblog.com/jake1036/archive/2011/06/30/149815.html</guid><wfw:comment>http://www.cppblog.com/jake1036/comments/149815.html</wfw:comment><comments>http://www.cppblog.com/jake1036/archive/2011/06/30/149815.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/jake1036/comments/commentRss/149815.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/jake1036/services/trackbacks/149815.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 高效率安排会议&nbsp;&nbsp;<a href='http://www.cppblog.com/jake1036/archive/2011/06/30/149815.html'>阅读全文</a><img src ="http://www.cppblog.com/jake1036/aggbug/149815.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/jake1036/" target="_blank">kahn</a> 2011-06-30 14:37 <a href="http://www.cppblog.com/jake1036/archive/2011/06/30/149815.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>分组背包问题（六）</title><link>http://www.cppblog.com/jake1036/archive/2011/06/28/149676.html</link><dc:creator>kahn</dc:creator><author>kahn</author><pubDate>Tue, 28 Jun 2011 12:03:00 GMT</pubDate><guid>http://www.cppblog.com/jake1036/archive/2011/06/28/149676.html</guid><wfw:comment>http://www.cppblog.com/jake1036/comments/149676.html</wfw:comment><comments>http://www.cppblog.com/jake1036/archive/2011/06/28/149676.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/jake1036/comments/commentRss/149676.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/jake1036/services/trackbacks/149676.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 分组背包问题（六）&nbsp;&nbsp;<a href='http://www.cppblog.com/jake1036/archive/2011/06/28/149676.html'>阅读全文</a><img src ="http://www.cppblog.com/jake1036/aggbug/149676.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/jake1036/" target="_blank">kahn</a> 2011-06-28 20:03 <a href="http://www.cppblog.com/jake1036/archive/2011/06/28/149676.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>二维背包问题（五）</title><link>http://www.cppblog.com/jake1036/archive/2011/06/28/149653.html</link><dc:creator>kahn</dc:creator><author>kahn</author><pubDate>Tue, 28 Jun 2011 07:02:00 GMT</pubDate><guid>http://www.cppblog.com/jake1036/archive/2011/06/28/149653.html</guid><wfw:comment>http://www.cppblog.com/jake1036/comments/149653.html</wfw:comment><comments>http://www.cppblog.com/jake1036/archive/2011/06/28/149653.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/jake1036/comments/commentRss/149653.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/jake1036/services/trackbacks/149653.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 二维背包问题&nbsp;&nbsp;<a href='http://www.cppblog.com/jake1036/archive/2011/06/28/149653.html'>阅读全文</a><img src ="http://www.cppblog.com/jake1036/aggbug/149653.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/jake1036/" target="_blank">kahn</a> 2011-06-28 15:02 <a href="http://www.cppblog.com/jake1036/archive/2011/06/28/149653.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>多重背包（三）</title><link>http://www.cppblog.com/jake1036/archive/2011/06/28/149648.html</link><dc:creator>kahn</dc:creator><author>kahn</author><pubDate>Tue, 28 Jun 2011 06:04:00 GMT</pubDate><guid>http://www.cppblog.com/jake1036/archive/2011/06/28/149648.html</guid><wfw:comment>http://www.cppblog.com/jake1036/comments/149648.html</wfw:comment><comments>http://www.cppblog.com/jake1036/archive/2011/06/28/149648.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/jake1036/comments/commentRss/149648.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/jake1036/services/trackbacks/149648.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 多重背包问题&nbsp;&nbsp;<a href='http://www.cppblog.com/jake1036/archive/2011/06/28/149648.html'>阅读全文</a><img src ="http://www.cppblog.com/jake1036/aggbug/149648.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/jake1036/" target="_blank">kahn</a> 2011-06-28 14:04 <a href="http://www.cppblog.com/jake1036/archive/2011/06/28/149648.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>完全背包问题 &lt;二&gt;</title><link>http://www.cppblog.com/jake1036/archive/2011/06/27/149602.html</link><dc:creator>kahn</dc:creator><author>kahn</author><pubDate>Mon, 27 Jun 2011 12:02:00 GMT</pubDate><guid>http://www.cppblog.com/jake1036/archive/2011/06/27/149602.html</guid><wfw:comment>http://www.cppblog.com/jake1036/comments/149602.html</wfw:comment><comments>http://www.cppblog.com/jake1036/archive/2011/06/27/149602.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/jake1036/comments/commentRss/149602.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/jake1036/services/trackbacks/149602.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 完全背包问题&nbsp;&nbsp;<a href='http://www.cppblog.com/jake1036/archive/2011/06/27/149602.html'>阅读全文</a><img src ="http://www.cppblog.com/jake1036/aggbug/149602.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/jake1036/" target="_blank">kahn</a> 2011-06-27 20:02 <a href="http://www.cppblog.com/jake1036/archive/2011/06/27/149602.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>面试100 36在字符串中删除指定的字符</title><link>http://www.cppblog.com/jake1036/archive/2011/05/22/146944.html</link><dc:creator>kahn</dc:creator><author>kahn</author><pubDate>Sun, 22 May 2011 14:25:00 GMT</pubDate><guid>http://www.cppblog.com/jake1036/archive/2011/05/22/146944.html</guid><wfw:comment>http://www.cppblog.com/jake1036/comments/146944.html</wfw:comment><comments>http://www.cppblog.com/jake1036/archive/2011/05/22/146944.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/jake1036/comments/commentRss/146944.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/jake1036/services/trackbacks/146944.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 面试100 36在字符串中删除指定的字符 &nbsp;&nbsp;<a href='http://www.cppblog.com/jake1036/archive/2011/05/22/146944.html'>阅读全文</a><img src ="http://www.cppblog.com/jake1036/aggbug/146944.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/jake1036/" target="_blank">kahn</a> 2011-05-22 22:25 <a href="http://www.cppblog.com/jake1036/archive/2011/05/22/146944.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>面试100 34找出数组中唯一出现一次的两个数字</title><link>http://www.cppblog.com/jake1036/archive/2011/05/21/146881.html</link><dc:creator>kahn</dc:creator><author>kahn</author><pubDate>Sat, 21 May 2011 13:20:00 GMT</pubDate><guid>http://www.cppblog.com/jake1036/archive/2011/05/21/146881.html</guid><wfw:comment>http://www.cppblog.com/jake1036/comments/146881.html</wfw:comment><comments>http://www.cppblog.com/jake1036/archive/2011/05/21/146881.html#Feedback</comments><slash:comments>2</slash:comments><wfw:commentRss>http://www.cppblog.com/jake1036/comments/commentRss/146881.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/jake1036/services/trackbacks/146881.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 面试100 34找出数组中两个只出现一次的数字&nbsp;&nbsp;<a href='http://www.cppblog.com/jake1036/archive/2011/05/21/146881.html'>阅读全文</a><img src ="http://www.cppblog.com/jake1036/aggbug/146881.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/jake1036/" target="_blank">kahn</a> 2011-05-21 21:20 <a href="http://www.cppblog.com/jake1036/archive/2011/05/21/146881.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>面试100 33使用o(1)的代价删除给定的节点</title><link>http://www.cppblog.com/jake1036/archive/2011/05/21/146879.html</link><dc:creator>kahn</dc:creator><author>kahn</author><pubDate>Sat, 21 May 2011 12:11:00 GMT</pubDate><guid>http://www.cppblog.com/jake1036/archive/2011/05/21/146879.html</guid><wfw:comment>http://www.cppblog.com/jake1036/comments/146879.html</wfw:comment><comments>http://www.cppblog.com/jake1036/archive/2011/05/21/146879.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/jake1036/comments/commentRss/146879.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/jake1036/services/trackbacks/146879.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 面试100 33使用O(1)的时间删除给定节点&nbsp;&nbsp;<a href='http://www.cppblog.com/jake1036/archive/2011/05/21/146879.html'>阅读全文</a><img src ="http://www.cppblog.com/jake1036/aggbug/146879.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/jake1036/" target="_blank">kahn</a> 2011-05-21 20:11 <a href="http://www.cppblog.com/jake1036/archive/2011/05/21/146879.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>面试100 32一个不可以被继承的类</title><link>http://www.cppblog.com/jake1036/archive/2011/05/21/146870.html</link><dc:creator>kahn</dc:creator><author>kahn</author><pubDate>Sat, 21 May 2011 07:54:00 GMT</pubDate><guid>http://www.cppblog.com/jake1036/archive/2011/05/21/146870.html</guid><wfw:comment>http://www.cppblog.com/jake1036/comments/146870.html</wfw:comment><comments>http://www.cppblog.com/jake1036/archive/2011/05/21/146870.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/jake1036/comments/commentRss/146870.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/jake1036/services/trackbacks/146870.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 面试100 32一个不可以被继承的类&nbsp;&nbsp;<a href='http://www.cppblog.com/jake1036/archive/2011/05/21/146870.html'>阅读全文</a><img src ="http://www.cppblog.com/jake1036/aggbug/146870.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/jake1036/" target="_blank">kahn</a> 2011-05-21 15:54 <a href="http://www.cppblog.com/jake1036/archive/2011/05/21/146870.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>面试100 31倒序输出链表中的字符</title><link>http://www.cppblog.com/jake1036/archive/2011/05/21/146869.html</link><dc:creator>kahn</dc:creator><author>kahn</author><pubDate>Sat, 21 May 2011 07:03:00 GMT</pubDate><guid>http://www.cppblog.com/jake1036/archive/2011/05/21/146869.html</guid><wfw:comment>http://www.cppblog.com/jake1036/comments/146869.html</wfw:comment><comments>http://www.cppblog.com/jake1036/archive/2011/05/21/146869.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/jake1036/comments/commentRss/146869.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/jake1036/services/trackbacks/146869.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 面试100 31倒序输出链接点&nbsp;&nbsp;<a href='http://www.cppblog.com/jake1036/archive/2011/05/21/146869.html'>阅读全文</a><img src ="http://www.cppblog.com/jake1036/aggbug/146869.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/jake1036/" target="_blank">kahn</a> 2011-05-21 15:03 <a href="http://www.cppblog.com/jake1036/archive/2011/05/21/146869.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>面试100 29调整数列中数使奇数位于偶数之前</title><link>http://www.cppblog.com/jake1036/archive/2011/05/20/146798.html</link><dc:creator>kahn</dc:creator><author>kahn</author><pubDate>Fri, 20 May 2011 02:29:00 GMT</pubDate><guid>http://www.cppblog.com/jake1036/archive/2011/05/20/146798.html</guid><wfw:comment>http://www.cppblog.com/jake1036/comments/146798.html</wfw:comment><comments>http://www.cppblog.com/jake1036/archive/2011/05/20/146798.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/jake1036/comments/commentRss/146798.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/jake1036/services/trackbacks/146798.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 面试100 29调整数列使奇数位于偶数之前&nbsp;&nbsp;<a href='http://www.cppblog.com/jake1036/archive/2011/05/20/146798.html'>阅读全文</a><img src ="http://www.cppblog.com/jake1036/aggbug/146798.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/jake1036/" target="_blank">kahn</a> 2011-05-20 10:29 <a href="http://www.cppblog.com/jake1036/archive/2011/05/20/146798.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>面试100 27二元树的深度</title><link>http://www.cppblog.com/jake1036/archive/2011/05/19/146746.html</link><dc:creator>kahn</dc:creator><author>kahn</author><pubDate>Thu, 19 May 2011 05:58:00 GMT</pubDate><guid>http://www.cppblog.com/jake1036/archive/2011/05/19/146746.html</guid><wfw:comment>http://www.cppblog.com/jake1036/comments/146746.html</wfw:comment><comments>http://www.cppblog.com/jake1036/archive/2011/05/19/146746.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/jake1036/comments/commentRss/146746.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/jake1036/services/trackbacks/146746.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 面试100  27二元树的深度&nbsp;&nbsp;<a href='http://www.cppblog.com/jake1036/archive/2011/05/19/146746.html'>阅读全文</a><img src ="http://www.cppblog.com/jake1036/aggbug/146746.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/jake1036/" target="_blank">kahn</a> 2011-05-19 13:58 <a href="http://www.cppblog.com/jake1036/archive/2011/05/19/146746.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>面试100 24判断栈的push序列和pop序列是否相等</title><link>http://www.cppblog.com/jake1036/archive/2011/05/19/146731.html</link><dc:creator>kahn</dc:creator><author>kahn</author><pubDate>Thu, 19 May 2011 01:59:00 GMT</pubDate><guid>http://www.cppblog.com/jake1036/archive/2011/05/19/146731.html</guid><wfw:comment>http://www.cppblog.com/jake1036/comments/146731.html</wfw:comment><comments>http://www.cppblog.com/jake1036/archive/2011/05/19/146731.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/jake1036/comments/commentRss/146731.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/jake1036/services/trackbacks/146731.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 面试100 24判断栈的push和pop序列是否正确&nbsp;&nbsp;<a href='http://www.cppblog.com/jake1036/archive/2011/05/19/146731.html'>阅读全文</a><img src ="http://www.cppblog.com/jake1036/aggbug/146731.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/jake1036/" target="_blank">kahn</a> 2011-05-19 09:59 <a href="http://www.cppblog.com/jake1036/archive/2011/05/19/146731.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>面试100 22整数n中包含的1的个数</title><link>http://www.cppblog.com/jake1036/archive/2011/05/18/146698.html</link><dc:creator>kahn</dc:creator><author>kahn</author><pubDate>Wed, 18 May 2011 13:15:00 GMT</pubDate><guid>http://www.cppblog.com/jake1036/archive/2011/05/18/146698.html</guid><wfw:comment>http://www.cppblog.com/jake1036/comments/146698.html</wfw:comment><comments>http://www.cppblog.com/jake1036/archive/2011/05/18/146698.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/jake1036/comments/commentRss/146698.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/jake1036/services/trackbacks/146698.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 面试100 22 整数n中包含的1的个数<br>&nbsp;&nbsp;<a href='http://www.cppblog.com/jake1036/archive/2011/05/18/146698.html'>阅读全文</a><img src ="http://www.cppblog.com/jake1036/aggbug/146698.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/jake1036/" target="_blank">kahn</a> 2011-05-18 21:15 <a href="http://www.cppblog.com/jake1036/archive/2011/05/18/146698.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>面试100 21左旋转字符串</title><link>http://www.cppblog.com/jake1036/archive/2011/05/18/146694.html</link><dc:creator>kahn</dc:creator><author>kahn</author><pubDate>Wed, 18 May 2011 12:03:00 GMT</pubDate><guid>http://www.cppblog.com/jake1036/archive/2011/05/18/146694.html</guid><wfw:comment>http://www.cppblog.com/jake1036/comments/146694.html</wfw:comment><comments>http://www.cppblog.com/jake1036/archive/2011/05/18/146694.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/jake1036/comments/commentRss/146694.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/jake1036/services/trackbacks/146694.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 面试100 21字符串左旋转&nbsp;&nbsp;<a href='http://www.cppblog.com/jake1036/archive/2011/05/18/146694.html'>阅读全文</a><img src ="http://www.cppblog.com/jake1036/aggbug/146694.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/jake1036/" target="_blank">kahn</a> 2011-05-18 20:03 <a href="http://www.cppblog.com/jake1036/archive/2011/05/18/146694.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>面试100 两个栈实现一个队列</title><link>http://www.cppblog.com/jake1036/archive/2011/05/18/146622.html</link><dc:creator>kahn</dc:creator><author>kahn</author><pubDate>Wed, 18 May 2011 02:16:00 GMT</pubDate><guid>http://www.cppblog.com/jake1036/archive/2011/05/18/146622.html</guid><wfw:comment>http://www.cppblog.com/jake1036/comments/146622.html</wfw:comment><comments>http://www.cppblog.com/jake1036/archive/2011/05/18/146622.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/jake1036/comments/commentRss/146622.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/jake1036/services/trackbacks/146622.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 面试100  18两个栈实现一个队列操作&nbsp;&nbsp;<a href='http://www.cppblog.com/jake1036/archive/2011/05/18/146622.html'>阅读全文</a><img src ="http://www.cppblog.com/jake1036/aggbug/146622.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/jake1036/" target="_blank">kahn</a> 2011-05-18 10:16 <a href="http://www.cppblog.com/jake1036/archive/2011/05/18/146622.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>面试100 15指针成员的类的copy</title><link>http://www.cppblog.com/jake1036/archive/2011/05/17/146594.html</link><dc:creator>kahn</dc:creator><author>kahn</author><pubDate>Tue, 17 May 2011 12:37:00 GMT</pubDate><guid>http://www.cppblog.com/jake1036/archive/2011/05/17/146594.html</guid><wfw:comment>http://www.cppblog.com/jake1036/comments/146594.html</wfw:comment><comments>http://www.cppblog.com/jake1036/archive/2011/05/17/146594.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/jake1036/comments/commentRss/146594.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/jake1036/services/trackbacks/146594.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 15 含有指针成员参数的类的copy&nbsp;&nbsp;<a href='http://www.cppblog.com/jake1036/archive/2011/05/17/146594.html'>阅读全文</a><img src ="http://www.cppblog.com/jake1036/aggbug/146594.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/jake1036/" target="_blank">kahn</a> 2011-05-17 20:37 <a href="http://www.cppblog.com/jake1036/archive/2011/05/17/146594.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>面试100 13第一个只出现一次的字符</title><link>http://www.cppblog.com/jake1036/archive/2011/05/17/146542.html</link><dc:creator>kahn</dc:creator><author>kahn</author><pubDate>Tue, 17 May 2011 02:25:00 GMT</pubDate><guid>http://www.cppblog.com/jake1036/archive/2011/05/17/146542.html</guid><wfw:comment>http://www.cppblog.com/jake1036/comments/146542.html</wfw:comment><comments>http://www.cppblog.com/jake1036/archive/2011/05/17/146542.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/jake1036/comments/commentRss/146542.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/jake1036/services/trackbacks/146542.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 面试100 13第一个只出现一次的字符&nbsp;&nbsp;<a href='http://www.cppblog.com/jake1036/archive/2011/05/17/146542.html'>阅读全文</a><img src ="http://www.cppblog.com/jake1036/aggbug/146542.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/jake1036/" target="_blank">kahn</a> 2011-05-17 10:25 <a href="http://www.cppblog.com/jake1036/archive/2011/05/17/146542.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>面试100 -11二叉树镜像</title><link>http://www.cppblog.com/jake1036/archive/2011/05/17/146536.html</link><dc:creator>kahn</dc:creator><author>kahn</author><pubDate>Tue, 17 May 2011 01:02:00 GMT</pubDate><guid>http://www.cppblog.com/jake1036/archive/2011/05/17/146536.html</guid><wfw:comment>http://www.cppblog.com/jake1036/comments/146536.html</wfw:comment><comments>http://www.cppblog.com/jake1036/archive/2011/05/17/146536.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/jake1036/comments/commentRss/146536.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/jake1036/services/trackbacks/146536.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 面试100 -11二叉树镜像&nbsp;&nbsp;<a href='http://www.cppblog.com/jake1036/archive/2011/05/17/146536.html'>阅读全文</a><img src ="http://www.cppblog.com/jake1036/aggbug/146536.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/jake1036/" target="_blank">kahn</a> 2011-05-17 09:02 <a href="http://www.cppblog.com/jake1036/archive/2011/05/17/146536.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>面试100 -09 单链表中查找倒数第K个元素</title><link>http://www.cppblog.com/jake1036/archive/2011/05/16/146496.html</link><dc:creator>kahn</dc:creator><author>kahn</author><pubDate>Mon, 16 May 2011 08:23:00 GMT</pubDate><guid>http://www.cppblog.com/jake1036/archive/2011/05/16/146496.html</guid><wfw:comment>http://www.cppblog.com/jake1036/comments/146496.html</wfw:comment><comments>http://www.cppblog.com/jake1036/archive/2011/05/16/146496.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/jake1036/comments/commentRss/146496.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/jake1036/services/trackbacks/146496.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 面试100 - 09 求单链表中倒数第k个元素&nbsp;&nbsp;<a href='http://www.cppblog.com/jake1036/archive/2011/05/16/146496.html'>阅读全文</a><img src ="http://www.cppblog.com/jake1036/aggbug/146496.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/jake1036/" target="_blank">kahn</a> 2011-05-16 16:23 <a href="http://www.cppblog.com/jake1036/archive/2011/05/16/146496.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>面试100题-06</title><link>http://www.cppblog.com/jake1036/archive/2011/05/16/146483.html</link><dc:creator>kahn</dc:creator><author>kahn</author><pubDate>Mon, 16 May 2011 06:33:00 GMT</pubDate><guid>http://www.cppblog.com/jake1036/archive/2011/05/16/146483.html</guid><wfw:comment>http://www.cppblog.com/jake1036/comments/146483.html</wfw:comment><comments>http://www.cppblog.com/jake1036/archive/2011/05/16/146483.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/jake1036/comments/commentRss/146483.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/jake1036/services/trackbacks/146483.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 面试100题-06 判断数组是否是查找二叉树的后序遍历序列&nbsp;&nbsp;<a href='http://www.cppblog.com/jake1036/archive/2011/05/16/146483.html'>阅读全文</a><img src ="http://www.cppblog.com/jake1036/aggbug/146483.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/jake1036/" target="_blank">kahn</a> 2011-05-16 14:33 <a href="http://www.cppblog.com/jake1036/archive/2011/05/16/146483.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>面试100题--05查找TPO k</title><link>http://www.cppblog.com/jake1036/archive/2011/05/16/146466.html</link><dc:creator>kahn</dc:creator><author>kahn</author><pubDate>Mon, 16 May 2011 03:22:00 GMT</pubDate><guid>http://www.cppblog.com/jake1036/archive/2011/05/16/146466.html</guid><wfw:comment>http://www.cppblog.com/jake1036/comments/146466.html</wfw:comment><comments>http://www.cppblog.com/jake1036/archive/2011/05/16/146466.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/jake1036/comments/commentRss/146466.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/jake1036/services/trackbacks/146466.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 算法100题---05 查找TOP k&nbsp;&nbsp;<a href='http://www.cppblog.com/jake1036/archive/2011/05/16/146466.html'>阅读全文</a><img src ="http://www.cppblog.com/jake1036/aggbug/146466.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/jake1036/" target="_blank">kahn</a> 2011-05-16 11:22 <a href="http://www.cppblog.com/jake1036/archive/2011/05/16/146466.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>2011-5-7百度实习生笔试</title><link>http://www.cppblog.com/jake1036/archive/2011/05/08/145938.html</link><dc:creator>kahn</dc:creator><author>kahn</author><pubDate>Sun, 08 May 2011 13:35:00 GMT</pubDate><guid>http://www.cppblog.com/jake1036/archive/2011/05/08/145938.html</guid><wfw:comment>http://www.cppblog.com/jake1036/comments/145938.html</wfw:comment><comments>http://www.cppblog.com/jake1036/archive/2011/05/08/145938.html#Feedback</comments><slash:comments>1</slash:comments><wfw:commentRss>http://www.cppblog.com/jake1036/comments/commentRss/145938.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/jake1036/services/trackbacks/145938.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 百度实现生笔试总结&nbsp;&nbsp;<a href='http://www.cppblog.com/jake1036/archive/2011/05/08/145938.html'>阅读全文</a><img src ="http://www.cppblog.com/jake1036/aggbug/145938.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/jake1036/" target="_blank">kahn</a> 2011-05-08 21:35 <a href="http://www.cppblog.com/jake1036/archive/2011/05/08/145938.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>KMP算法</title><link>http://www.cppblog.com/jake1036/archive/2011/05/05/145769.html</link><dc:creator>kahn</dc:creator><author>kahn</author><pubDate>Thu, 05 May 2011 12:33:00 GMT</pubDate><guid>http://www.cppblog.com/jake1036/archive/2011/05/05/145769.html</guid><wfw:comment>http://www.cppblog.com/jake1036/comments/145769.html</wfw:comment><comments>http://www.cppblog.com/jake1036/archive/2011/05/05/145769.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/jake1036/comments/commentRss/145769.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/jake1036/services/trackbacks/145769.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: KMP算法&nbsp;&nbsp;<a href='http://www.cppblog.com/jake1036/archive/2011/05/05/145769.html'>阅读全文</a><img src ="http://www.cppblog.com/jake1036/aggbug/145769.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/jake1036/" target="_blank">kahn</a> 2011-05-05 20:33 <a href="http://www.cppblog.com/jake1036/archive/2011/05/05/145769.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>图算法-prim 与 Djkstra方法之间的区别</title><link>http://www.cppblog.com/jake1036/archive/2011/05/03/145525.html</link><dc:creator>kahn</dc:creator><author>kahn</author><pubDate>Tue, 03 May 2011 01:31:00 GMT</pubDate><guid>http://www.cppblog.com/jake1036/archive/2011/05/03/145525.html</guid><wfw:comment>http://www.cppblog.com/jake1036/comments/145525.html</wfw:comment><comments>http://www.cppblog.com/jake1036/archive/2011/05/03/145525.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/jake1036/comments/commentRss/145525.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/jake1036/services/trackbacks/145525.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: PRIM算法与DIJKSTRA算法之间的区别&nbsp;&nbsp;<a href='http://www.cppblog.com/jake1036/archive/2011/05/03/145525.html'>阅读全文</a><img src ="http://www.cppblog.com/jake1036/aggbug/145525.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/jake1036/" target="_blank">kahn</a> 2011-05-03 09:31 <a href="http://www.cppblog.com/jake1036/archive/2011/05/03/145525.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>