﻿<?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++博客-ngaut-最新评论</title><link>http://www.cppblog.com/ngaut/CommentsRSS.aspx</link><description>asm/c/c++/......</description><language>zh-cn</language><pubDate>Tue, 30 Oct 2012 09:10:56 GMT</pubDate><lastBuildDate>Tue, 30 Oct 2012 09:10:56 GMT</lastBuildDate><generator>cnblogs</generator><item><title>re: 二叉树的遍历：前序，中序，后序，层序－－包括递归和非递归实现</title><link>http://www.cppblog.com/ngaut/archive/2012/09/06/2351.html#189654</link><dc:creator>youk</dc:creator><author>youk</author><pubDate>Thu, 06 Sep 2012 02:44:00 GMT</pubDate><guid>http://www.cppblog.com/ngaut/archive/2012/09/06/2351.html#189654</guid><description><![CDATA[谢谢楼主 收藏了 <img src ="http://www.cppblog.com/ngaut/aggbug/189654.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/ngaut/" target="_blank">youk</a> 2012-09-06 10:44 <a href="http://www.cppblog.com/ngaut/archive/2012/09/06/2351.html#189654#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: [转]Visual Studio .NET 2003 安装时的1309错误，留着备用^_^</title><link>http://www.cppblog.com/ngaut/archive/2012/08/24/9398.html#188117</link><dc:creator>同樣問題</dc:creator><author>同樣問題</author><pubDate>Fri, 24 Aug 2012 03:33:00 GMT</pubDate><guid>http://www.cppblog.com/ngaut/archive/2012/08/24/9398.html#188117</guid><description><![CDATA[在安装中出现错误提示后，保留画面，换盘CD2，按“重试”按钮，嘿嘿，安装进度条又开始跑起来了 &gt;&gt; 這句話太重要了 ! <br><br>已經可以繼續安裝下去。 <img src ="http://www.cppblog.com/ngaut/aggbug/188117.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/ngaut/" target="_blank">同樣問題</a> 2012-08-24 11:33 <a href="http://www.cppblog.com/ngaut/archive/2012/08/24/9398.html#188117#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: [转]Visual C++开发工具与调试技巧整理[未登录]</title><link>http://www.cppblog.com/ngaut/archive/2012/03/20/57181.html#168360</link><dc:creator>Jack</dc:creator><author>Jack</author><pubDate>Tue, 20 Mar 2012 00:09:00 GMT</pubDate><guid>http://www.cppblog.com/ngaut/archive/2012/03/20/57181.html#168360</guid><description><![CDATA[HAO<img src ="http://www.cppblog.com/ngaut/aggbug/168360.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/ngaut/" target="_blank">Jack</a> 2012-03-20 08:09 <a href="http://www.cppblog.com/ngaut/archive/2012/03/20/57181.html#168360#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 二叉树的遍历：前序，中序，后序，层序－－包括递归和非递归实现</title><link>http://www.cppblog.com/ngaut/archive/2011/11/27/2351.html#161018</link><dc:creator>ling</dc:creator><author>ling</author><pubDate>Sat, 26 Nov 2011 17:46:00 GMT</pubDate><guid>http://www.cppblog.com/ngaut/archive/2011/11/27/2351.html#161018</guid><description><![CDATA[如果这样的话，那所谓的树的，非递归的，先中后遍历就是可以弄成一种，只是把，后序改为前序而已 <img src ="http://www.cppblog.com/ngaut/aggbug/161018.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/ngaut/" target="_blank">ling</a> 2011-11-27 01:46 <a href="http://www.cppblog.com/ngaut/archive/2011/11/27/2351.html#161018#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: [原创]soso指数格式分析</title><link>http://www.cppblog.com/ngaut/archive/2011/11/17/110494.html#160308</link><dc:creator>MarquezMonica28</dc:creator><author>MarquezMonica28</author><pubDate>Wed, 16 Nov 2011 21:46:00 GMT</pubDate><guid>http://www.cppblog.com/ngaut/archive/2011/11/17/110494.html#160308</guid><description><![CDATA[Do you acknowledge that this is correct time to receive the &lt;a href=&quot;<a target="_new" href="http://goodfinance-blog.com/topics/mortgage-loans&quot;&gt;mortgage">http://goodfinance-blog.com/topics/mortgage-loans&quot;&gt;mortgage</a> loans&lt;/a&gt;, which can make you dreams real. <img src ="http://www.cppblog.com/ngaut/aggbug/160308.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/ngaut/" target="_blank">MarquezMonica28</a> 2011-11-17 05:46 <a href="http://www.cppblog.com/ngaut/archive/2011/11/17/110494.html#160308#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 二叉树的遍历：前序，中序，后序，层序－－包括递归和非递归实现</title><link>http://www.cppblog.com/ngaut/archive/2011/10/19/2351.html#158642</link><dc:creator>0102</dc:creator><author>0102</author><pubDate>Tue, 18 Oct 2011 17:05:00 GMT</pubDate><guid>http://www.cppblog.com/ngaut/archive/2011/10/19/2351.html#158642</guid><description><![CDATA[在前面的基础上，还可以这样改。<br>void BT_PostOrderNoRec(pTreeT root) <br>{ <br>stack&lt;treeT *&gt; s; <br>pTreeT pre = NULL; <br>pTreeT top = NULL; <br><br>while ((NULL != root) || !s.empty()) <br>{ <br>if (NULL != root) <br>{ <br>s.push(root); <br>root = root-&gt;left; <br>} <br>else <br>{ <br>top = s.top(); <br>if(/*top-&gt;right != NULL &amp;&amp; */top-&gt;right != pre) <br>{<br>root = top-&gt;right;<br>pre = NULL;//pre是一次性的，比较完了一次以后就失效了；<br>} <br>else <br>{ <br>visit(top); <br>pre = top; <br>s.pop(); <br>} <br>} <br>} <br>} <img src ="http://www.cppblog.com/ngaut/aggbug/158642.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/ngaut/" target="_blank">0102</a> 2011-10-19 01:05 <a href="http://www.cppblog.com/ngaut/archive/2011/10/19/2351.html#158642#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 无意中发现Geek Os中memcmp函数的bug</title><link>http://www.cppblog.com/ngaut/archive/2011/10/12/12155.html#158164</link><dc:creator>stackpop</dc:creator><author>stackpop</author><pubDate>Wed, 12 Oct 2011 13:29:00 GMT</pubDate><guid>http://www.cppblog.com/ngaut/archive/2011/10/12/12155.html#158164</guid><description><![CDATA[我比较好奇的是为什么这里的char*是signed,而以前我看到的基本上是unsigned<img src ="http://www.cppblog.com/ngaut/aggbug/158164.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/ngaut/" target="_blank">stackpop</a> 2011-10-12 21:29 <a href="http://www.cppblog.com/ngaut/archive/2011/10/12/12155.html#158164#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 数据结构笔记：递归的魅力——迷宫求解</title><link>http://www.cppblog.com/ngaut/archive/2011/06/13/2036.html#148599</link><dc:creator>xxf</dc:creator><author>xxf</author><pubDate>Mon, 13 Jun 2011 10:36:00 GMT</pubDate><guid>http://www.cppblog.com/ngaut/archive/2011/06/13/2036.html#148599</guid><description><![CDATA[如果是<br>1 0 1<br>1 0 1<br>1 1 1<br>输出只是<br>6 0 1<br>6 0 1<br>6 1 1<img src ="http://www.cppblog.com/ngaut/aggbug/148599.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/ngaut/" target="_blank">xxf</a> 2011-06-13 18:36 <a href="http://www.cppblog.com/ngaut/archive/2011/06/13/2036.html#148599#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 数据结构笔记：递归的魅力——迷宫求解</title><link>http://www.cppblog.com/ngaut/archive/2011/06/13/2036.html#148598</link><dc:creator>xxf</dc:creator><author>xxf</author><pubDate>Mon, 13 Jun 2011 10:33:00 GMT</pubDate><guid>http://www.cppblog.com/ngaut/archive/2011/06/13/2036.html#148598</guid><description><![CDATA[有bug啊<br><img src ="http://www.cppblog.com/ngaut/aggbug/148598.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/ngaut/" target="_blank">xxf</a> 2011-06-13 18:33 <a href="http://www.cppblog.com/ngaut/archive/2011/06/13/2036.html#148598#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: [转]模拟WSockExpert,使用APIHOOK </title><link>http://www.cppblog.com/ngaut/archive/2011/03/29/37331.html#142905</link><dc:creator>李国龙</dc:creator><author>李国龙</author><pubDate>Tue, 29 Mar 2011 01:38:00 GMT</pubDate><guid>http://www.cppblog.com/ngaut/archive/2011/03/29/37331.html#142905</guid><description><![CDATA[你好，能否把上面的工程发给我一份，我的邮箱dhlwq007@163.com,谢谢！<img src ="http://www.cppblog.com/ngaut/aggbug/142905.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/ngaut/" target="_blank">李国龙</a> 2011-03-29 09:38 <a href="http://www.cppblog.com/ngaut/archive/2011/03/29/37331.html#142905#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>