C++博客-合工大很牛很牛牛-最新评论http://www.cppblog.com/deep2/CommentsRSS.aspxzh-cnTue, 28 Oct 2008 04:28:16 GMTTue, 28 Oct 2008 04:28:16 GMTcnblogsre: 长整数相加http://www.cppblog.com/deep2/archive/2008/10/26/64999.html#65099春天春天Sun, 26 Oct 2008 08:06:00 GMThttp://www.cppblog.com/deep2/archive/2008/10/26/64999.html#65099 c->intLst.push_front(*rIterA++ + carry);//如99+123最高位百位还要进位一次
carry=0;
}
while(rIterB!=b.intLst.rend()){
c->intLst.push_front(*rIterB++ +carry);
carry=0;
}
你考虑了最高位还会进一位，没有考虑再进n位；如果999999+5，试下。

春天 2008-10-26 16:06 发表评论
]]>re: 后缀表达式计算http://www.cppblog.com/deep2/archive/2008/10/26/65021.html#65098deep2deep2Sun, 26 Oct 2008 07:32:00 GMThttp://www.cppblog.com/deep2/archive/2008/10/26/65021.html#65098352×5--
等于
push 3
push 5
push 2
multiply 5*2
push 10 (5*2的结果)
push 5
sub 10-5
push 5 (10-5的结果)
sub 3-5
push -2 (3-5的结果）

return -2

deep2 2008-10-26 15:32 发表评论
]]>re: 后缀表达式计算http://www.cppblog.com/deep2/archive/2008/10/26/65021.html#65089金山词霸2008金山词霸2008Sun, 26 Oct 2008 06:41:00 GMThttp://www.cppblog.com/deep2/archive/2008/10/26/65021.html#65089

]]>re: 后缀表达式计算http://www.cppblog.com/deep2/archive/2008/10/26/65021.html#65053陈梓瀚(vczh)陈梓瀚(vczh)Sat, 25 Oct 2008 19:22:00 GMThttp://www.cppblog.com/deep2/archive/2008/10/26/65021.html#65053变成
push 3
push 5
push 2
multiply
push 5
sub
sub

陈梓瀚(vczh) 2008-10-26 03:22 发表评论
]]>re: 稀疏多项式的实现http://www.cppblog.com/deep2/archive/2008/10/25/64854.html#65019deep2deep2Sat, 25 Oct 2008 09:14:00 GMThttp://www.cppblog.com/deep2/archive/2008/10/25/64854.html#65019比如：A = 3x^99 + 4x^999
B = 2x^2 + 6x^99
求 A+B

deep2 2008-10-25 17:14 发表评论
]]>re: 稀疏多项式的实现http://www.cppblog.com/deep2/archive/2008/10/25/64854.html#65014金山词霸2008金山词霸2008Sat, 25 Oct 2008 08:51:00 GMThttp://www.cppblog.com/deep2/archive/2008/10/25/64854.html#65014

]]>re: 长整数相加http://www.cppblog.com/deep2/archive/2008/10/25/64999.html#65010金山毒霸2008金山毒霸2008Sat, 25 Oct 2008 08:44:00 GMThttp://www.cppblog.com/deep2/archive/2008/10/25/64999.html#65010

]]>re: 约瑟夫问题——使用STL链表解决http://www.cppblog.com/deep2/archive/2008/10/24/64798.html#64925deep2deep2Fri, 24 Oct 2008 05:03:00 GMThttp://www.cppblog.com/deep2/archive/2008/10/24/64798.html#64925谢谢~！

deep2 2008-10-24 13:03 发表评论
]]>re: 约瑟夫问题——使用STL链表解决http://www.cppblog.com/deep2/archive/2008/10/24/64798.html#64903jhjhThu, 23 Oct 2008 16:36:00 GMThttp://www.cppblog.com/deep2/archive/2008/10/24/64798.html#64903a.erase(temp); 改为： itor = a.erase(itor);
这样就不用temp了

jh 2008-10-24 00:36 发表评论
]]>re: 约瑟夫问题——使用STL链表解决http://www.cppblog.com/deep2/archive/2008/10/23/64798.html#64813水水Thu, 23 Oct 2008 07:06:00 GMThttp://www.cppblog.com/deep2/archive/2008/10/23/64798.html#64813

水 2008-10-23 15:06 发表评论
]]>