C++博客-程序描绘人生-最新评论http://www.cppblog.com/humanchao/CommentsRSS.aspx知识改变命运，学习成就未来。zh-cnFri, 12 Sep 2008 12:50:26 GMTFri, 12 Sep 2008 12:50:26 GMTcnblogsre: 图解快速排序:转http://www.cppblog.com/humanchao/archive/2008/08/19/51098.html#59339小螃蟹小螃蟹Tue, 19 Aug 2008 06:44:00 GMThttp://www.cppblog.com/humanchao/archive/2008/08/19/51098.html#59339

小螃蟹 2008-08-19 14:44 发表评论
]]>re: VC取得目录大小http://www.cppblog.com/humanchao/archive/2008/07/03/55154.html#55191pangpangThu, 03 Jul 2008 02:28:00 GMThttp://www.cppblog.com/humanchao/archive/2008/07/03/55154.html#55191现在正在找人写一个VC的书。
如果想把这些内容和更多的人分享，可以和我联系，把这些东西写成书。
我的邮箱：books_522008@yahoo.com.cn

pang 2008-07-03 10:28 发表评论
]]>re: 图解快速排序:转http://www.cppblog.com/humanchao/archive/2008/06/16/51098.html#53532不错不错Mon, 16 Jun 2008 05:54:00 GMThttp://www.cppblog.com/humanchao/archive/2008/06/16/51098.html#53532

不错 2008-06-16 13:54 发表评论
]]>re: 图解快速排序:转http://www.cppblog.com/humanchao/archive/2008/06/15/51098.html#53358passerbypasserbySun, 15 Jun 2008 11:32:00 GMThttp://www.cppblog.com/humanchao/archive/2008/06/15/51098.html#53358

passerby 2008-06-15 19:32 发表评论
]]>re: 判断单链表是否存在环，判断两个链表是否相交问题详解http://www.cppblog.com/humanchao/archive/2008/05/22/47357.html#50754jiejieThu, 22 May 2008 06:06:00 GMThttp://www.cppblog.com/humanchao/archive/2008/05/22/47357.html#50754

jie 2008-05-22 14:06 发表评论
]]>re: VC中取得毫秒级的时间http://www.cppblog.com/humanchao/archive/2008/04/22/43322.html#47839greatwsgreatwsTue, 22 Apr 2008 11:32:00 GMThttp://www.cppblog.com/humanchao/archive/2008/04/22/43322.html#47839

greatws 2008-04-22 19:32 发表评论
]]>re: 单链表逆序输出[未登录]http://www.cppblog.com/humanchao/archive/2008/04/18/43446.html#47551christanxwchristanxwFri, 18 Apr 2008 15:43:00 GMThttp://www.cppblog.com/humanchao/archive/2008/04/18/43446.html#47551

christanxw 2008-04-18 23:43 发表评论
]]>re: 判断单链表是否存在环，判断两个链表是否相交问题详解http://www.cppblog.com/humanchao/archive/2008/04/17/47357.html#47381FongLuoFongLuoThu, 17 Apr 2008 05:41:00 GMThttp://www.cppblog.com/humanchao/archive/2008/04/17/47357.html#47381

FongLuo 2008-04-17 13:41 发表评论
]]>re: 判断单链表是否存在环，判断两个链表是否相交问题详解http://www.cppblog.com/humanchao/archive/2008/04/17/47357.html#47380seraph.cxlseraph.cxlThu, 17 Apr 2008 05:36:00 GMThttp://www.cppblog.com/humanchao/archive/2008/04/17/47357.html#47380

seraph.cxl 2008-04-17 13:36 发表评论
]]>re: 判断单链表是否存在环，判断两个链表是否相交问题详解[未登录]http://www.cppblog.com/humanchao/archive/2008/04/17/47357.html#47371AAAAAAAAThu, 17 Apr 2008 04:25:00 GMThttp://www.cppblog.com/humanchao/archive/2008/04/17/47357.html#47371

AAAA 2008-04-17 12:25 发表评论
]]>re: 判断单链表是否存在环，判断两个链表是否相交问题详解[未登录]http://www.cppblog.com/humanchao/archive/2008/04/17/47357.html#47366stevenstevenThu, 17 Apr 2008 03:28:00 GMThttp://www.cppblog.com/humanchao/archive/2008/04/17/47357.html#47366

steven 2008-04-17 11:28 发表评论
]]>re: 判断单链表是否存在环，判断两个链表是否相交问题详解http://www.cppblog.com/humanchao/archive/2008/04/17/47357.html#47365大海大海Thu, 17 Apr 2008 03:03:00 GMThttp://www.cppblog.com/humanchao/archive/2008/04/17/47357.html#47365

大海 2008-04-17 11:03 发表评论
]]>re: 为二维数组循环赋值http://www.cppblog.com/humanchao/archive/2008/03/04/43655.html#43693raof01raof01Tue, 04 Mar 2008 08:29:00 GMThttp://www.cppblog.com/humanchao/archive/2008/03/04/43655.html#43693template <size_t N1, size_t N2>
void Convert(int (&array)[N1][N2])
{
int all = N1 * N2;
int i = 0;
int j = -1;
int direction = 0;
int val = 0;
while(val < all)
{
if (0 == direction)
{
++j;
if (j < N2 && -1 == array[i][j])
{
array[i][j] = val;
}
else
{
direction = 1;
--j;
}
}
if (1 == direction)
{
++i;
if (i < N1 && -1 == array[i][j])
{
array[i][j] = val;
}
else
{
direction = 2;
--i;
}
}
if (2 == direction)
{
--j;
if (j >= 0 && -1 == array[i][j])
{
array[i][j] = val;
}
else
{
direction = 3;
++j;
}
}
if (3 == direction)
{
--i;
if (i >= 0 && -1 == array[i][j])
{
array[i][j] = val;
}
else
{
direction = 0;
++i;
--val;
}
}
++val;
}
}

raof01 2008-03-04 16:29 发表评论
]]>re: 为二维数组循环赋值http://www.cppblog.com/humanchao/archive/2008/03/04/43655.html#43685EnochEnochTue, 04 Mar 2008 06:39:00 GMThttp://www.cppblog.com/humanchao/archive/2008/03/04/43655.html#43685不错，这个与循环相比，时空性怎样啊！
分析时空性，我想这篇大作应该不只是
“如下代码要优雅一些”

顶！

Enoch 2008-03-04 14:39 发表评论
]]>re: 单链表逆序输出http://www.cppblog.com/humanchao/archive/2008/03/01/43446.html#43509winstywinstySat, 01 Mar 2008 02:00:00 GMThttp://www.cppblog.com/humanchao/archive/2008/03/01/43446.html#43509

winsty 2008-03-01 10:00 发表评论
]]>re: 单链表逆序输出http://www.cppblog.com/humanchao/archive/2008/02/29/43446.html#43483comiunknowncomiunknownFri, 29 Feb 2008 10:27:00 GMThttp://www.cppblog.com/humanchao/archive/2008/02/29/43446.html#43483

comiunknown 2008-02-29 18:27 发表评论
]]>re: 单链表逆序输出http://www.cppblog.com/humanchao/archive/2008/02/29/43446.html#43478humanchaohumanchaoFri, 29 Feb 2008 10:01:00 GMThttp://www.cppblog.com/humanchao/archive/2008/02/29/43446.html#43478谢谢您的鼓励！

humanchao 2008-02-29 18:01 发表评论
]]>re: 单链表逆序输出http://www.cppblog.com/humanchao/archive/2008/02/29/43446.html#43476浪迹天涯浪迹天涯Fri, 29 Feb 2008 09:08:00 GMThttp://www.cppblog.com/humanchao/archive/2008/02/29/43446.html#43476我觉得递归 可能是最先想到的
第一张方法也很巧妙 已经回答的很好了

浪迹天涯 2008-02-29 17:08 发表评论
]]>re: 单链表逆序输出[未登录]http://www.cppblog.com/humanchao/archive/2008/02/29/43446.html#43466santasantaFri, 29 Feb 2008 06:40:00 GMThttp://www.cppblog.com/humanchao/archive/2008/02/29/43446.html#43466

santa 2008-02-29 14:40 发表评论
]]>re: 单链表逆序输出http://www.cppblog.com/humanchao/archive/2008/02/29/43446.html#43462魔域私服魔域私服Fri, 29 Feb 2008 05:27:00 GMThttp://www.cppblog.com/humanchao/archive/2008/02/29/43446.html#43462

魔域私服 2008-02-29 13:27 发表评论
]]>