C++博客-adai123-最新评论http://www.cppblog.com/adai123/CommentsRSS.aspxzh-cnMon, 23 Mar 2009 08:21:05 GMTMon, 23 Mar 2009 08:21:05 GMTcnblogsre: 编程之美-编程判断两个链表是否相交http://www.cppblog.com/adai123/archive/2009/03/23/77580.html#77601陈梓瀚(vczh)陈梓瀚(vczh)Mon, 23 Mar 2009 09:12:00 GMThttp://www.cppblog.com/adai123/archive/2009/03/23/77580.html#77601{
Node(){};
public:
static smart_ptr<Node> Create(){return new Node;}
int data;
smart_ptr<Node> next;
};

不连成环就行。

陈梓瀚(vczh) 2009-03-23 17:12 发表评论
]]>re: 编程之美-编程判断两个链表是否相交http://www.cppblog.com/adai123/archive/2009/03/23/77580.html#77598阿呆阿呆Mon, 23 Mar 2009 09:06:00 GMThttp://www.cppblog.com/adai123/archive/2009/03/23/77580.html#77598
不过 smart_ptr怎么做？


阿呆 2009-03-23 17:06 发表评论
]]>re: 编程之美-编程判断两个链表是否相交http://www.cppblog.com/adai123/archive/2009/03/23/77580.html#77593陈梓瀚(vczh)陈梓瀚(vczh)Mon, 23 Mar 2009 08:50:00 GMThttp://www.cppblog.com/adai123/archive/2009/03/23/77580.html#77593
或者用smart_ptr

陈梓瀚(vczh) 2009-03-23 16:50 发表评论
]]>re: HeadFirst学习笔记3-装饰者模式http://www.cppblog.com/adai123/archive/2008/10/11/52684.html#63779路人路人Sat, 11 Oct 2008 15:14:00 GMThttp://www.cppblog.com/adai123/archive/2008/10/11/52684.html#63779

路人 2008-10-11 23:14 发表评论
]]>