﻿<?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/deep2/category/8581.html</link><description /><language>zh-cn</language><lastBuildDate>Sat, 25 Oct 2008 05:52:16 GMT</lastBuildDate><pubDate>Sat, 25 Oct 2008 05:52:16 GMT</pubDate><ttl>60</ttl><item><title>长整数相加</title><link>http://www.cppblog.com/deep2/archive/2008/10/25/64999.html</link><dc:creator>deep2</dc:creator><author>deep2</author><pubDate>Sat, 25 Oct 2008 04:48:00 GMT</pubDate><guid>http://www.cppblog.com/deep2/archive/2008/10/25/64999.html</guid><wfw:comment>http://www.cppblog.com/deep2/comments/64999.html</wfw:comment><comments>http://www.cppblog.com/deep2/archive/2008/10/25/64999.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/deep2/comments/commentRss/64999.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/deep2/services/trackbacks/64999.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 利用链表存储长整数中的每一个数字，再利用反向迭代器实现相加&nbsp;&nbsp;<a href='http://www.cppblog.com/deep2/archive/2008/10/25/64999.html'>阅读全文</a><img src ="http://www.cppblog.com/deep2/aggbug/64999.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/deep2/" target="_blank">deep2</a> 2008-10-25 12:48 <a href="http://www.cppblog.com/deep2/archive/2008/10/25/64999.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>反向迭代器的用法</title><link>http://www.cppblog.com/deep2/archive/2008/10/24/64972.html</link><dc:creator>deep2</dc:creator><author>deep2</author><pubDate>Fri, 24 Oct 2008 15:43:00 GMT</pubDate><guid>http://www.cppblog.com/deep2/archive/2008/10/24/64972.html</guid><wfw:comment>http://www.cppblog.com/deep2/comments/64972.html</wfw:comment><comments>http://www.cppblog.com/deep2/archive/2008/10/24/64972.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/deep2/comments/commentRss/64972.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/deep2/services/trackbacks/64972.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 反向迭代器的用法&nbsp;&nbsp;<a href='http://www.cppblog.com/deep2/archive/2008/10/24/64972.html'>阅读全文</a><img src ="http://www.cppblog.com/deep2/aggbug/64972.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/deep2/" target="_blank">deep2</a> 2008-10-24 23:43 <a href="http://www.cppblog.com/deep2/archive/2008/10/24/64972.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>稀疏多项式加法</title><link>http://www.cppblog.com/deep2/archive/2008/10/23/64877.html</link><dc:creator>deep2</dc:creator><author>deep2</author><pubDate>Thu, 23 Oct 2008 13:25:00 GMT</pubDate><guid>http://www.cppblog.com/deep2/archive/2008/10/23/64877.html</guid><wfw:comment>http://www.cppblog.com/deep2/comments/64877.html</wfw:comment><comments>http://www.cppblog.com/deep2/archive/2008/10/23/64877.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/deep2/comments/commentRss/64877.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/deep2/services/trackbacks/64877.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 稀疏多项式加法&nbsp;&nbsp;<a href='http://www.cppblog.com/deep2/archive/2008/10/23/64877.html'>阅读全文</a><img src ="http://www.cppblog.com/deep2/aggbug/64877.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/deep2/" target="_blank">deep2</a> 2008-10-23 21:25 <a href="http://www.cppblog.com/deep2/archive/2008/10/23/64877.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>稀疏多项式的实现</title><link>http://www.cppblog.com/deep2/archive/2008/10/23/64854.html</link><dc:creator>deep2</dc:creator><author>deep2</author><pubDate>Thu, 23 Oct 2008 10:44:00 GMT</pubDate><guid>http://www.cppblog.com/deep2/archive/2008/10/23/64854.html</guid><wfw:comment>http://www.cppblog.com/deep2/comments/64854.html</wfw:comment><comments>http://www.cppblog.com/deep2/archive/2008/10/23/64854.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/deep2/comments/commentRss/64854.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/deep2/services/trackbacks/64854.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 只是实现了多项式的输入输出，主要是想说明用什么方式来存储稀疏多项式&nbsp;&nbsp;<a href='http://www.cppblog.com/deep2/archive/2008/10/23/64854.html'>阅读全文</a><img src ="http://www.cppblog.com/deep2/aggbug/64854.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/deep2/" target="_blank">deep2</a> 2008-10-23 18:44 <a href="http://www.cppblog.com/deep2/archive/2008/10/23/64854.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>约瑟夫问题——使用STL链表解决</title><link>http://www.cppblog.com/deep2/archive/2008/10/23/64798.html</link><dc:creator>deep2</dc:creator><author>deep2</author><pubDate>Thu, 23 Oct 2008 05:41:00 GMT</pubDate><guid>http://www.cppblog.com/deep2/archive/2008/10/23/64798.html</guid><wfw:comment>http://www.cppblog.com/deep2/comments/64798.html</wfw:comment><comments>http://www.cppblog.com/deep2/archive/2008/10/23/64798.html#Feedback</comments><slash:comments>3</slash:comments><wfw:commentRss>http://www.cppblog.com/deep2/comments/commentRss/64798.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/deep2/services/trackbacks/64798.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: n个人围坐，从第一个人开始报数，数到m的人出列，再从下一个人开始重新报数，求出列顺序。&nbsp;&nbsp;<a href='http://www.cppblog.com/deep2/archive/2008/10/23/64798.html'>阅读全文</a><img src ="http://www.cppblog.com/deep2/aggbug/64798.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/deep2/" target="_blank">deep2</a> 2008-10-23 13:41 <a href="http://www.cppblog.com/deep2/archive/2008/10/23/64798.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>STL中链表的基本操作</title><link>http://www.cppblog.com/deep2/archive/2008/10/23/64794.html</link><dc:creator>deep2</dc:creator><author>deep2</author><pubDate>Thu, 23 Oct 2008 04:43:00 GMT</pubDate><guid>http://www.cppblog.com/deep2/archive/2008/10/23/64794.html</guid><wfw:comment>http://www.cppblog.com/deep2/comments/64794.html</wfw:comment><comments>http://www.cppblog.com/deep2/archive/2008/10/23/64794.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/deep2/comments/commentRss/64794.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/deep2/services/trackbacks/64794.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: STL中链表的基本操作&nbsp;&nbsp;<a href='http://www.cppblog.com/deep2/archive/2008/10/23/64794.html'>阅读全文</a><img src ="http://www.cppblog.com/deep2/aggbug/64794.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/deep2/" target="_blank">deep2</a> 2008-10-23 12:43 <a href="http://www.cppblog.com/deep2/archive/2008/10/23/64794.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>双向循环链表的创建，插入和遍历</title><link>http://www.cppblog.com/deep2/archive/2008/10/22/64716.html</link><dc:creator>deep2</dc:creator><author>deep2</author><pubDate>Wed, 22 Oct 2008 10:12:00 GMT</pubDate><guid>http://www.cppblog.com/deep2/archive/2008/10/22/64716.html</guid><wfw:comment>http://www.cppblog.com/deep2/comments/64716.html</wfw:comment><comments>http://www.cppblog.com/deep2/archive/2008/10/22/64716.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/deep2/comments/commentRss/64716.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/deep2/services/trackbacks/64716.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 双向循环链表的创建，插入和遍历&nbsp;&nbsp;<a href='http://www.cppblog.com/deep2/archive/2008/10/22/64716.html'>阅读全文</a><img src ="http://www.cppblog.com/deep2/aggbug/64716.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/deep2/" target="_blank">deep2</a> 2008-10-22 18:12 <a href="http://www.cppblog.com/deep2/archive/2008/10/22/64716.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>单链表创建、插入和遍历</title><link>http://www.cppblog.com/deep2/archive/2008/10/22/64713.html</link><dc:creator>deep2</dc:creator><author>deep2</author><pubDate>Wed, 22 Oct 2008 09:33:00 GMT</pubDate><guid>http://www.cppblog.com/deep2/archive/2008/10/22/64713.html</guid><wfw:comment>http://www.cppblog.com/deep2/comments/64713.html</wfw:comment><comments>http://www.cppblog.com/deep2/archive/2008/10/22/64713.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/deep2/comments/commentRss/64713.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/deep2/services/trackbacks/64713.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 单链表基本操作：创建、插入和遍历&nbsp;&nbsp;<a href='http://www.cppblog.com/deep2/archive/2008/10/22/64713.html'>阅读全文</a><img src ="http://www.cppblog.com/deep2/aggbug/64713.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/deep2/" target="_blank">deep2</a> 2008-10-22 17:33 <a href="http://www.cppblog.com/deep2/archive/2008/10/22/64713.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>