﻿<?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/svmsung/CommentsRSS.aspx</link><description>一心编程，就没有解决不了的问题</description><language>zh-cn</language><pubDate>Mon, 01 Aug 2011 01:12:09 GMT</pubDate><lastBuildDate>Mon, 01 Aug 2011 01:12:09 GMT</lastBuildDate><generator>cnblogs</generator><item><title>re: 快速判断素数算法</title><link>http://www.cppblog.com/svmsung/archive/2011/08/01/120584.html#152189</link><dc:creator>李熙建</dc:creator><author>李熙建</author><pubDate>Mon, 01 Aug 2011 01:19:00 GMT</pubDate><guid>http://www.cppblog.com/svmsung/archive/2011/08/01/120584.html#152189</guid><description><![CDATA[@某W<br>谢谢，抛砖引玉而已，期待你提出更优秀的方法<img src ="http://www.cppblog.com/svmsung/aggbug/152189.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/svmsung/" target="_blank">李熙建</a> 2011-08-01 09:19 <a href="http://www.cppblog.com/svmsung/archive/2011/08/01/120584.html#152189#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 判断单链表是否有环</title><link>http://www.cppblog.com/svmsung/archive/2011/08/01/127499.html#152188</link><dc:creator>李熙建</dc:creator><author>李熙建</author><pubDate>Mon, 01 Aug 2011 01:14:00 GMT</pubDate><guid>http://www.cppblog.com/svmsung/archive/2011/08/01/127499.html#152188</guid><description><![CDATA[@kyle<br>非常感谢你指出其中的错误<img src ="http://www.cppblog.com/svmsung/aggbug/152188.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/svmsung/" target="_blank">李熙建</a> 2011-08-01 09:14 <a href="http://www.cppblog.com/svmsung/archive/2011/08/01/127499.html#152188#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 快速判断素数算法</title><link>http://www.cppblog.com/svmsung/archive/2011/06/02/120584.html#147971</link><dc:creator>某W</dc:creator><author>某W</author><pubDate>Thu, 02 Jun 2011 12:47:00 GMT</pubDate><guid>http://www.cppblog.com/svmsung/archive/2011/06/02/120584.html#147971</guid><description><![CDATA[这方法很强大~<br>谢谢~<img src ="http://www.cppblog.com/svmsung/aggbug/147971.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/svmsung/" target="_blank">某W</a> 2011-06-02 20:47 <a href="http://www.cppblog.com/svmsung/archive/2011/06/02/120584.html#147971#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 判断单链表是否有环[未登录]</title><link>http://www.cppblog.com/svmsung/archive/2011/05/06/127499.html#145836</link><dc:creator>kyle</dc:creator><author>kyle</author><pubDate>Fri, 06 May 2011 09:49:00 GMT</pubDate><guid>http://www.cppblog.com/svmsung/archive/2011/05/06/127499.html#145836</guid><description><![CDATA[代码有错...永远返回TRUE.<br>在对fast初始化的时候应该是fast=head-&gt;next;<img src ="http://www.cppblog.com/svmsung/aggbug/145836.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/svmsung/" target="_blank">kyle</a> 2011-05-06 17:49 <a href="http://www.cppblog.com/svmsung/archive/2011/05/06/127499.html#145836#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 判断单链表是否有环</title><link>http://www.cppblog.com/svmsung/archive/2010/09/26/127499.html#127805</link><dc:creator>李熙建</dc:creator><author>李熙建</author><pubDate>Sun, 26 Sep 2010 13:46:00 GMT</pubDate><guid>http://www.cppblog.com/svmsung/archive/2010/09/26/127499.html#127805</guid><description><![CDATA[@Algorics<br>一般情况下，只已知链表的头节点，链表元素个数已知的情况下，你说的方法可以<img src ="http://www.cppblog.com/svmsung/aggbug/127805.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/svmsung/" target="_blank">李熙建</a> 2010-09-26 21:46 <a href="http://www.cppblog.com/svmsung/archive/2010/09/26/127499.html#127805#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 判断单链表是否有环</title><link>http://www.cppblog.com/svmsung/archive/2010/09/25/127499.html#127571</link><dc:creator>Algorics</dc:creator><author>Algorics</author><pubDate>Sat, 25 Sep 2010 00:16:00 GMT</pubDate><guid>http://www.cppblog.com/svmsung/archive/2010/09/25/127499.html#127571</guid><description><![CDATA[如果知道链表的结点数n，那么如果进行n+1次找下一个结点还没到链表的尾部的话就有环。<img src ="http://www.cppblog.com/svmsung/aggbug/127571.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/svmsung/" target="_blank">Algorics</a> 2010-09-25 08:16 <a href="http://www.cppblog.com/svmsung/archive/2010/09/25/127499.html#127571#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: Material Editor</title><link>http://www.cppblog.com/svmsung/archive/2010/01/18/96218.html#105937</link><dc:creator>lxping</dc:creator><author>lxping</author><pubDate>Mon, 18 Jan 2010 07:44:00 GMT</pubDate><guid>http://www.cppblog.com/svmsung/archive/2010/01/18/96218.html#105937</guid><description><![CDATA[想请教一下  怎么结合shader的？<img src ="http://www.cppblog.com/svmsung/aggbug/105937.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/svmsung/" target="_blank">lxping</a> 2010-01-18 15:44 <a href="http://www.cppblog.com/svmsung/archive/2010/01/18/96218.html#105937#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: Material Editor</title><link>http://www.cppblog.com/svmsung/archive/2009/09/15/96218.html#96249</link><dc:creator>李熙建</dc:creator><author>李熙建</author><pubDate>Tue, 15 Sep 2009 09:49:00 GMT</pubDate><guid>http://www.cppblog.com/svmsung/archive/2009/09/15/96218.html#96249</guid><description><![CDATA[@Davy.xu<br>OGRE是开源的，Unreal不开源，只能广泛的搜集信息，由远及近的包围，最终能做出类似的效果，当然咯实现方式可能不一样，All roads to Rome<img src ="http://www.cppblog.com/svmsung/aggbug/96249.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/svmsung/" target="_blank">李熙建</a> 2009-09-15 17:49 <a href="http://www.cppblog.com/svmsung/archive/2009/09/15/96218.html#96249#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: Material Editor[未登录]</title><link>http://www.cppblog.com/svmsung/archive/2009/09/15/96218.html#96228</link><dc:creator>Davy.xu</dc:creator><author>Davy.xu</author><pubDate>Tue, 15 Sep 2009 08:40:00 GMT</pubDate><guid>http://www.cppblog.com/svmsung/archive/2009/09/15/96218.html#96228</guid><description><![CDATA[参考OGRE的就可以了，unreal的看几年都不一定完全弄懂的<img src ="http://www.cppblog.com/svmsung/aggbug/96228.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/svmsung/" target="_blank">Davy.xu</a> 2009-09-15 16:40 <a href="http://www.cppblog.com/svmsung/archive/2009/09/15/96218.html#96228#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>