阅读背景:

从头到尾遍历(C ++ LL Q:1)

来源:互联网 

int LinkedList::DoStuff()
{
Node *Current    = next_;
while ( Current != NULL )
    {
        Current = Current->next_;
        length_++;
    }
    // At the last iteration we have reached the end/tail/last node
    return length_;
}
int LinkedList::DoStuff()
{
Node *Current   



你的当前访问异常,请进行认证后继续阅读剩余内容。

分享到: