﻿<?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++博客-Fly me to the moon-随笔分类-笔试/面试</title><link>http://www.cppblog.com/xiaoyisnail/category/11807.html</link><description>the beauty of C++</description><language>zh-cn</language><lastBuildDate>Mon, 05 Oct 2009 12:18:18 GMT</lastBuildDate><pubDate>Mon, 05 Oct 2009 12:18:18 GMT</pubDate><ttl>60</ttl><item><title>笔面试题目记录(一)</title><link>http://www.cppblog.com/xiaoyisnail/archive/2009/09/30/97663.html</link><dc:creator>翼帆</dc:creator><author>翼帆</author><pubDate>Wed, 30 Sep 2009 08:27:00 GMT</pubDate><guid>http://www.cppblog.com/xiaoyisnail/archive/2009/09/30/97663.html</guid><wfw:comment>http://www.cppblog.com/xiaoyisnail/comments/97663.html</wfw:comment><comments>http://www.cppblog.com/xiaoyisnail/archive/2009/09/30/97663.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/xiaoyisnail/comments/commentRss/97663.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/xiaoyisnail/services/trackbacks/97663.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 找工作的第一场仗打得非常漂亮，能在国庆前就拿到一个不错的offer回家算是一个完美的开局了，不过接下去的10月，11月才是重头戏，希望也能完美收官吧。刚刚回到家里，打算把前两天笔试面试中碰到的一些题目记录在这里，并给出自己的实现。以后每过一阶段都会在这里总结一次碰到的题目，加以整理和进一步的思考，为后面的硬仗做好充分的准备。fighting~快慢指针判断单链表是否有环这题是出现在笔试题里的一道选择...&nbsp;&nbsp;<a href='http://www.cppblog.com/xiaoyisnail/archive/2009/09/30/97663.html'>阅读全文</a><img src ="http://www.cppblog.com/xiaoyisnail/aggbug/97663.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/xiaoyisnail/" target="_blank">翼帆</a> 2009-09-30 16:27 <a href="http://www.cppblog.com/xiaoyisnail/archive/2009/09/30/97663.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>基本算法练习(二)</title><link>http://www.cppblog.com/xiaoyisnail/archive/2009/09/28/97483.html</link><dc:creator>翼帆</dc:creator><author>翼帆</author><pubDate>Mon, 28 Sep 2009 12:36:00 GMT</pubDate><guid>http://www.cppblog.com/xiaoyisnail/archive/2009/09/28/97483.html</guid><wfw:comment>http://www.cppblog.com/xiaoyisnail/comments/97483.html</wfw:comment><comments>http://www.cppblog.com/xiaoyisnail/archive/2009/09/28/97483.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/xiaoyisnail/comments/commentRss/97483.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/xiaoyisnail/services/trackbacks/97483.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 这两天狂累，研究报告、宣讲会、见面会、笔试、面试所有的事情都连续在一起，忙得够呛，今天面完阿里研究院，总算有点时间了，于是先把上次提到的其它一些基本算法练习完成。这次的练习包括：原地堆排序，归并排序，基于快排的选择，计数排序，插值查找。原地heap sort使用最大堆，基于两个堆的基本操作siftdown和siftup实现如下两个步骤，事实上代码里只用了siftdown，注意：这里的堆是从下标0开...&nbsp;&nbsp;<a href='http://www.cppblog.com/xiaoyisnail/archive/2009/09/28/97483.html'>阅读全文</a><img src ="http://www.cppblog.com/xiaoyisnail/aggbug/97483.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/xiaoyisnail/" target="_blank">翼帆</a> 2009-09-28 20:36 <a href="http://www.cppblog.com/xiaoyisnail/archive/2009/09/28/97483.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>基本算法练习(一)</title><link>http://www.cppblog.com/xiaoyisnail/archive/2009/09/22/96939.html</link><dc:creator>翼帆</dc:creator><author>翼帆</author><pubDate>Tue, 22 Sep 2009 06:02:00 GMT</pubDate><guid>http://www.cppblog.com/xiaoyisnail/archive/2009/09/22/96939.html</guid><wfw:comment>http://www.cppblog.com/xiaoyisnail/comments/96939.html</wfw:comment><comments>http://www.cppblog.com/xiaoyisnail/archive/2009/09/22/96939.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/xiaoyisnail/comments/commentRss/96939.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/xiaoyisnail/services/trackbacks/96939.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 笔试面试中常常会要求应聘者用自己最擅长的语言实现一些基本算法，这种考基本功的问题还是需要认真对待的。很多基本算法虽然表面上思想很简单，但在实现为程序的时候却总是会有很多非常tricky的问题让你阴沟里翻船，要么死循环了，要么数组越界了，要么整数溢出了。所以平时多练练手，在笔试面试的时候可以短时间内正确地实现这些算法，就可以给面试官一个基本功扎实的好印象，还能增加自信心，绝对能给笔试面试加不少分。下...&nbsp;&nbsp;<a href='http://www.cppblog.com/xiaoyisnail/archive/2009/09/22/96939.html'>阅读全文</a><img src ="http://www.cppblog.com/xiaoyisnail/aggbug/96939.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/xiaoyisnail/" target="_blank">翼帆</a> 2009-09-22 14:02 <a href="http://www.cppblog.com/xiaoyisnail/archive/2009/09/22/96939.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>