﻿<?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++博客-千张笔记-随笔分类-程序员笔试宝典</title><link>http://www.cppblog.com/qianqian/category/13884.html</link><description>Email:rain_qian830@163.com</description><language>zh-cn</language><lastBuildDate>Sun, 23 May 2010 16:45:38 GMT</lastBuildDate><pubDate>Sun, 23 May 2010 16:45:38 GMT</pubDate><ttl>60</ttl><item><title>【原】找到单链表中间的那个元素</title><link>http://www.cppblog.com/qianqian/archive/2010/05/23/116185.html</link><dc:creator>千张</dc:creator><author>千张</author><pubDate>Sun, 23 May 2010 13:15:00 GMT</pubDate><guid>http://www.cppblog.com/qianqian/archive/2010/05/23/116185.html</guid><wfw:comment>http://www.cppblog.com/qianqian/comments/116185.html</wfw:comment><comments>http://www.cppblog.com/qianqian/archive/2010/05/23/116185.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/qianqian/comments/commentRss/116185.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/qianqian/services/trackbacks/116185.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 找到单向链表中间的那个元素，如果有两个则取前面一个。&nbsp;&nbsp;<a href='http://www.cppblog.com/qianqian/archive/2010/05/23/116185.html'>阅读全文</a><img src ="http://www.cppblog.com/qianqian/aggbug/116185.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/qianqian/" target="_blank">千张</a> 2010-05-23 21:15 <a href="http://www.cppblog.com/qianqian/archive/2010/05/23/116185.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>【转】实现两个N*N矩阵的乘法</title><link>http://www.cppblog.com/qianqian/archive/2010/05/23/116180.html</link><dc:creator>千张</dc:creator><author>千张</author><pubDate>Sun, 23 May 2010 10:09:00 GMT</pubDate><guid>http://www.cppblog.com/qianqian/archive/2010/05/23/116180.html</guid><wfw:comment>http://www.cppblog.com/qianqian/comments/116180.html</wfw:comment><comments>http://www.cppblog.com/qianqian/archive/2010/05/23/116180.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/qianqian/comments/commentRss/116180.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/qianqian/services/trackbacks/116180.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 实现两个N*N矩阵的乘法&nbsp;&nbsp;<a href='http://www.cppblog.com/qianqian/archive/2010/05/23/116180.html'>阅读全文</a><img src ="http://www.cppblog.com/qianqian/aggbug/116180.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/qianqian/" target="_blank">千张</a> 2010-05-23 18:09 <a href="http://www.cppblog.com/qianqian/archive/2010/05/23/116180.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>【转】如何减少换页错误</title><link>http://www.cppblog.com/qianqian/archive/2010/05/23/116172.html</link><dc:creator>千张</dc:creator><author>千张</author><pubDate>Sun, 23 May 2010 08:54:00 GMT</pubDate><guid>http://www.cppblog.com/qianqian/archive/2010/05/23/116172.html</guid><wfw:comment>http://www.cppblog.com/qianqian/comments/116172.html</wfw:comment><comments>http://www.cppblog.com/qianqian/archive/2010/05/23/116172.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/qianqian/comments/commentRss/116172.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/qianqian/services/trackbacks/116172.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 如何减少换页错误&nbsp;&nbsp;<a href='http://www.cppblog.com/qianqian/archive/2010/05/23/116172.html'>阅读全文</a><img src ="http://www.cppblog.com/qianqian/aggbug/116172.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/qianqian/" target="_blank">千张</a> 2010-05-23 16:54 <a href="http://www.cppblog.com/qianqian/archive/2010/05/23/116172.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>【转】 计算时间复杂度的公式</title><link>http://www.cppblog.com/qianqian/archive/2010/05/20/115890.html</link><dc:creator>千张</dc:creator><author>千张</author><pubDate>Thu, 20 May 2010 03:11:00 GMT</pubDate><guid>http://www.cppblog.com/qianqian/archive/2010/05/20/115890.html</guid><wfw:comment>http://www.cppblog.com/qianqian/comments/115890.html</wfw:comment><comments>http://www.cppblog.com/qianqian/archive/2010/05/20/115890.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/qianqian/comments/commentRss/115890.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/qianqian/services/trackbacks/115890.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 计算时间复杂度的公式&nbsp;&nbsp;<a href='http://www.cppblog.com/qianqian/archive/2010/05/20/115890.html'>阅读全文</a><img src ="http://www.cppblog.com/qianqian/aggbug/115890.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/qianqian/" target="_blank">千张</a> 2010-05-20 11:11 <a href="http://www.cppblog.com/qianqian/archive/2010/05/20/115890.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>