﻿<?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/humanchao/CommentsRSS.aspx</link><description>知识改变命运，学习成就未来。</description><language>zh-cn</language><pubDate>Tue, 26 Jun 2018 08:52:27 GMT</pubDate><lastBuildDate>Tue, 26 Jun 2018 08:52:27 GMT</lastBuildDate><generator>cnblogs</generator><item><title>re: 迷宫最短路径问题解析</title><link>http://www.cppblog.com/humanchao/archive/2016/05/03/44783.html#213412</link><dc:creator>胡满超</dc:creator><author>胡满超</author><pubDate>Tue, 03 May 2016 05:05:00 GMT</pubDate><guid>http://www.cppblog.com/humanchao/archive/2016/05/03/44783.html#213412</guid><description><![CDATA[@rover<br>这个是C++模板<img src ="http://www.cppblog.com/humanchao/aggbug/213412.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/humanchao/" target="_blank">胡满超</a> 2016-05-03 13:05 <a href="http://www.cppblog.com/humanchao/archive/2016/05/03/44783.html#213412#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 迷宫最短路径问题解析</title><link>http://www.cppblog.com/humanchao/archive/2016/04/16/44783.html#213299</link><dc:creator>rover</dc:creator><author>rover</author><pubDate>Sat, 16 Apr 2016 12:09:00 GMT</pubDate><guid>http://www.cppblog.com/humanchao/archive/2016/04/16/44783.html#213299</guid><description><![CDATA[stack&lt;Postion&gt; path__;<br>这个里面 ”&lt;&gt; “符号是什么意思？我在C++语言里面没见过呢？ 初学者，大神勿喷。<img src ="http://www.cppblog.com/humanchao/aggbug/213299.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/humanchao/" target="_blank">rover</a> 2016-04-16 20:09 <a href="http://www.cppblog.com/humanchao/archive/2016/04/16/44783.html#213299#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 机器学习算法原理与编程实践 代码下载地址</title><link>http://www.cppblog.com/humanchao/archive/2016/04/13/212388.html#213262</link><dc:creator>naomi</dc:creator><author>naomi</author><pubDate>Wed, 13 Apr 2016 05:11:00 GMT</pubDate><guid>http://www.cppblog.com/humanchao/archive/2016/04/13/212388.html#213262</guid><description><![CDATA[跪谢大神了，帮了我很多<img src ="http://www.cppblog.com/humanchao/aggbug/213262.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/humanchao/" target="_blank">naomi</a> 2016-04-13 13:11 <a href="http://www.cppblog.com/humanchao/archive/2016/04/13/212388.html#213262#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 如何在NSIS中执行BAT文件</title><link>http://www.cppblog.com/humanchao/archive/2016/01/01/56962.html#212584</link><dc:creator>舒</dc:creator><author>舒</author><pubDate>Fri, 01 Jan 2016 05:10:00 GMT</pubDate><guid>http://www.cppblog.com/humanchao/archive/2016/01/01/56962.html#212584</guid><description><![CDATA[@humanchao<br>我想试试软件<img src ="http://www.cppblog.com/humanchao/aggbug/212584.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/humanchao/" target="_blank">舒</a> 2016-01-01 13:10 <a href="http://www.cppblog.com/humanchao/archive/2016/01/01/56962.html#212584#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 判断单链表是否存在环，判断两个链表是否相交问题详解</title><link>http://www.cppblog.com/humanchao/archive/2015/03/22/47357.html#210130</link><dc:creator>lookdown</dc:creator><author>lookdown</author><pubDate>Sun, 22 Mar 2015 08:11:00 GMT</pubDate><guid>http://www.cppblog.com/humanchao/archive/2015/03/22/47357.html#210130</guid><description><![CDATA[n只可能是1<img src ="http://www.cppblog.com/humanchao/aggbug/210130.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/humanchao/" target="_blank">lookdown</a> 2015-03-22 16:11 <a href="http://www.cppblog.com/humanchao/archive/2015/03/22/47357.html#210130#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 判断单链表是否存在环，判断两个链表是否相交问题详解</title><link>http://www.cppblog.com/humanchao/archive/2015/01/09/47357.html#209441</link><dc:creator>gqqnbig</dc:creator><author>gqqnbig</author><pubDate>Thu, 08 Jan 2015 20:59:00 GMT</pubDate><guid>http://www.cppblog.com/humanchao/archive/2015/01/09/47357.html#209441</guid><description><![CDATA[当fast若与slow相遇时，slow肯定没有走遍历完链表@科匠<br><br>那有没有可能slow已经走了多于一圈了呢？<img src ="http://www.cppblog.com/humanchao/aggbug/209441.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/humanchao/" target="_blank">gqqnbig</a> 2015-01-09 04:59 <a href="http://www.cppblog.com/humanchao/archive/2015/01/09/47357.html#209441#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 迷宫最短路径问题解析</title><link>http://www.cppblog.com/humanchao/archive/2014/12/22/44783.html#209270</link><dc:creator>11</dc:creator><author>11</author><pubDate>Mon, 22 Dec 2014 07:19:00 GMT</pubDate><guid>http://www.cppblog.com/humanchao/archive/2014/12/22/44783.html#209270</guid><description><![CDATA[。。。。。。。。<img src ="http://www.cppblog.com/humanchao/aggbug/209270.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/humanchao/" target="_blank">11</a> 2014-12-22 15:19 <a href="http://www.cppblog.com/humanchao/archive/2014/12/22/44783.html#209270#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 转：CTime与CString相互转化  </title><link>http://www.cppblog.com/humanchao/archive/2014/05/15/206944.html#206971</link><dc:creator>胡满超</dc:creator><author>胡满超</author><pubDate>Thu, 15 May 2014 05:32:00 GMT</pubDate><guid>http://www.cppblog.com/humanchao/archive/2014/05/15/206944.html#206971</guid><description><![CDATA[看起来很简练啊 @杨粼波<br><img src ="http://www.cppblog.com/humanchao/aggbug/206971.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/humanchao/" target="_blank">胡满超</a> 2014-05-15 13:32 <a href="http://www.cppblog.com/humanchao/archive/2014/05/15/206944.html#206971#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 转：CTime与CString相互转化  </title><link>http://www.cppblog.com/humanchao/archive/2014/05/13/206944.html#206951</link><dc:creator>杨粼波</dc:creator><author>杨粼波</author><pubDate>Tue, 13 May 2014 14:54:00 GMT</pubDate><guid>http://www.cppblog.com/humanchao/archive/2014/05/13/206944.html#206951</guid><description><![CDATA[不用这么复杂，看这里：<a target="_new" href="http://www.cppblog.com/tx7do/archive/2011/05/06/145800.html">http://www.cppblog.com/tx7do/archive/2011/05/06/145800.html</a><img src ="http://www.cppblog.com/humanchao/aggbug/206951.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/humanchao/" target="_blank">杨粼波</a> 2014-05-13 22:54 <a href="http://www.cppblog.com/humanchao/archive/2014/05/13/206944.html#206951#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: VC取得目录大小[未登录]</title><link>http://www.cppblog.com/humanchao/archive/2014/03/21/55154.html#206267</link><dc:creator>xy</dc:creator><author>xy</author><pubDate>Fri, 21 Mar 2014 10:40:00 GMT</pubDate><guid>http://www.cppblog.com/humanchao/archive/2014/03/21/55154.html#206267</guid><description><![CDATA[GetDiskFreeSpaceEx获得的是驱动器实际占用的空间，而下面代码获得的是目录大小，请问如何获得目录实际占用的空间？ sinee3000@sina.com<img src ="http://www.cppblog.com/humanchao/aggbug/206267.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/humanchao/" target="_blank">xy</a> 2014-03-21 18:40 <a href="http://www.cppblog.com/humanchao/archive/2014/03/21/55154.html#206267#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 判断单链表是否存在环，判断两个链表是否相交问题详解</title><link>http://www.cppblog.com/humanchao/archive/2014/03/12/47357.html#206145</link><dc:creator>xiximydream</dc:creator><author>xiximydream</author><pubDate>Wed, 12 Mar 2014 14:13:00 GMT</pubDate><guid>http://www.cppblog.com/humanchao/archive/2014/03/12/47357.html#206145</guid><description><![CDATA[可以理解fast走2步，slow走1步，因为走k次后，他们的距离为2*k-k=k可以为任意整数，我想问fast走3步可否，是否能更快发现环<img src ="http://www.cppblog.com/humanchao/aggbug/206145.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/humanchao/" target="_blank">xiximydream</a> 2014-03-12 22:13 <a href="http://www.cppblog.com/humanchao/archive/2014/03/12/47357.html#206145#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: Windows Driver Developer Kit 2003 WIN DDK 3790.1830 下载 Download 地址</title><link>http://www.cppblog.com/humanchao/archive/2014/01/21/168726.html#205511</link><dc:creator>李宗波</dc:creator><author>李宗波</author><pubDate>Mon, 20 Jan 2014 21:43:00 GMT</pubDate><guid>http://www.cppblog.com/humanchao/archive/2014/01/21/168726.html#205511</guid><description><![CDATA[学习学习----------------<img src ="http://www.cppblog.com/humanchao/aggbug/205511.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/humanchao/" target="_blank">李宗波</a> 2014-01-21 05:43 <a href="http://www.cppblog.com/humanchao/archive/2014/01/21/168726.html#205511#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 12306网站网上订票系统问题浅析与改进建议</title><link>http://www.cppblog.com/humanchao/archive/2014/01/08/193322.html#205247</link><dc:creator>zbb</dc:creator><author>zbb</author><pubDate>Wed, 08 Jan 2014 15:40:00 GMT</pubDate><guid>http://www.cppblog.com/humanchao/archive/2014/01/08/193322.html#205247</guid><description><![CDATA[如果是我做这个系统，<br>1.应该把服务器放在各个省会的铁路局。<br>比如你买上海到成都的票，就登录到上海的服务器，这样分担服务器被百万人同时访问的压力。<br>2.把抢票和付款分开，提供给客户是一个串号，客户通过该串号到付款的服务器上付款就可以了，也可以通过身份证号查出自己抢的号再付款，不需要你去记住这个串号。凡是没有付款成功的，都以余票流向实点售票处。<br>这样系统就默认你抢票成功。当天不能再抢票。一个身份证号只有一个注册号。<br>3.验证码 采用类似计算的方式的图片，需要计算才有结果的输入。比如 3七加二1=？ 就输入58. 中间可以是汉字，符号，数字混合，还有提问题等。让软件无法识别或困难。<br>4.没有抢到票时， 提供建议方案或线路。<br>5.目前有的优点保留，其他还没有想到，想到再增加。<br>------------------------------------------<br>你们怎么认为？<img src ="http://www.cppblog.com/humanchao/aggbug/205247.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/humanchao/" target="_blank">zbb</a> 2014-01-08 23:40 <a href="http://www.cppblog.com/humanchao/archive/2014/01/08/193322.html#205247#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 12306网站网上订票系统问题浅析与改进建议</title><link>http://www.cppblog.com/humanchao/archive/2014/01/06/193322.html#205208</link><dc:creator>白桦</dc:creator><author>白桦</author><pubDate>Mon, 06 Jan 2014 14:19:00 GMT</pubDate><guid>http://www.cppblog.com/humanchao/archive/2014/01/06/193322.html#205208</guid><description><![CDATA[我建议12306能否采取以下措施<br>1，春运期间，取消退票制度,，买进必乘，不乘作废。要求乘客买票时加以注意避免损失，这样可以控制黄牛倒票行为。<br>2，12306提供一个网络支付平台，网络买票成功后钱款自动划拨支付，然后短信邮件通知乘车人取票。<img src ="http://www.cppblog.com/humanchao/aggbug/205208.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/humanchao/" target="_blank">白桦</a> 2014-01-06 22:19 <a href="http://www.cppblog.com/humanchao/archive/2014/01/06/193322.html#205208#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 12306网站网上订票系统问题浅析与改进建议</title><link>http://www.cppblog.com/humanchao/archive/2013/12/13/193322.html#204784</link><dc:creator>逗号</dc:creator><author>逗号</author><pubDate>Fri, 13 Dec 2013 09:53:00 GMT</pubDate><guid>http://www.cppblog.com/humanchao/archive/2013/12/13/193322.html#204784</guid><description><![CDATA[你要想下国家投资了3亿多做出一个这么垃圾的系统，如果只是满足非高峰期的需求，搞个外包公司十几二十万就搞定了@Lo<br><img src ="http://www.cppblog.com/humanchao/aggbug/204784.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/humanchao/" target="_blank">逗号</a> 2013-12-13 17:53 <a href="http://www.cppblog.com/humanchao/archive/2013/12/13/193322.html#204784#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 推荐两本有关IPD好书</title><link>http://www.cppblog.com/humanchao/archive/2012/12/11/195011.html#196154</link><dc:creator>yadove</dc:creator><author>yadove</author><pubDate>Tue, 11 Dec 2012 00:56:00 GMT</pubDate><guid>http://www.cppblog.com/humanchao/archive/2012/12/11/195011.html#196154</guid><description><![CDATA[再推荐一本老书《培思的力量》。<img src ="http://www.cppblog.com/humanchao/aggbug/196154.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/humanchao/" target="_blank">yadove</a> 2012-12-11 08:56 <a href="http://www.cppblog.com/humanchao/archive/2012/12/11/195011.html#196154#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 判断单链表是否存在环，判断两个链表是否相交问题详解</title><link>http://www.cppblog.com/humanchao/archive/2012/11/12/47357.html#195053</link><dc:creator>胡满超</dc:creator><author>胡满超</author><pubDate>Mon, 12 Nov 2012 01:01:00 GMT</pubDate><guid>http://www.cppblog.com/humanchao/archive/2012/11/12/47357.html#195053</guid><description><![CDATA[您是对的，您指的是四个节点，且最后一个节点向第一个节点，就出现了您说的情况@科匠<br><br><img src ="http://www.cppblog.com/humanchao/aggbug/195053.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/humanchao/" target="_blank">胡满超</a> 2012-11-12 09:01 <a href="http://www.cppblog.com/humanchao/archive/2012/11/12/47357.html#195053#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 判断单链表是否存在环，判断两个链表是否相交问题详解</title><link>http://www.cppblog.com/humanchao/archive/2012/11/11/47357.html#195049</link><dc:creator>科匠</dc:creator><author>科匠</author><pubDate>Sun, 11 Nov 2012 15:12:00 GMT</pubDate><guid>http://www.cppblog.com/humanchao/archive/2012/11/11/47357.html#195049</guid><description><![CDATA[“当fast若与slow相遇时，slow肯定没有走遍历完链表，而fast已经在环内循环了n圈(1&lt;=n) 。”<br><br>有问题？slow有可能走完一圈了。<br>你用带四个节点的环模拟一下。slow有可能遍历完的。<br><br><img src ="http://www.cppblog.com/humanchao/aggbug/195049.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/humanchao/" target="_blank">科匠</a> 2012-11-11 23:12 <a href="http://www.cppblog.com/humanchao/archive/2012/11/11/47357.html#195049#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 12306网站网上订票系统问题浅析与改进建议</title><link>http://www.cppblog.com/humanchao/archive/2012/10/17/193322.html#193416</link><dc:creator>Lo</dc:creator><author>Lo</author><pubDate>Wed, 17 Oct 2012 07:17:00 GMT</pubDate><guid>http://www.cppblog.com/humanchao/archive/2012/10/17/193322.html#193416</guid><description><![CDATA[@胡满超<br>不要太过偏激 全年365天只有最高峰时间的几天(最多不超过20天)才会出问题 没必要把他全部否定吧? 平时另外的345天买票都不算?<img src ="http://www.cppblog.com/humanchao/aggbug/193416.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/humanchao/" target="_blank">Lo</a> 2012-10-17 15:17 <a href="http://www.cppblog.com/humanchao/archive/2012/10/17/193322.html#193416#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 12306网站网上订票系统问题浅析与改进建议</title><link>http://www.cppblog.com/humanchao/archive/2012/10/17/193322.html#193415</link><dc:creator>Lo</dc:creator><author>Lo</author><pubDate>Wed, 17 Oct 2012 07:12:00 GMT</pubDate><guid>http://www.cppblog.com/humanchao/archive/2012/10/17/193322.html#193415</guid><description><![CDATA[问题1 不是前端服务器可以解决的, 12306分2部分 一部分动态,一部分静态 静态部分随时都可以显示出来 是用了cdn<br>问题2 应该是服务器过载,导致服务器丢失了cookie<br>问题3 也不是分库可以解决的, 比如说我要查询北京到上海的火车 你分了库 就要把每个数据库都查一次 响应速度会变得更慢, 效率也没有提高<br>问题4 同2<br>问题5 同1<br>问题6 现在真不是问题<img src ="http://www.cppblog.com/humanchao/aggbug/193415.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/humanchao/" target="_blank">Lo</a> 2012-10-17 15:12 <a href="http://www.cppblog.com/humanchao/archive/2012/10/17/193322.html#193415#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>