【摘】如何将一个单向链表倒序输出

]5f#g:P^4G]R0法一：51Testing软件测试网i.S[*Y7`#l C%v

#include <iostream>
K-}?Hq\ _+]0#include <cstdlib>51Testing软件测试网bZ4h t^^j2u
using namespace std;
&jh2G;O;|0
|:H.RpI!D5L0IQ0struct Node
Y7Y0g#h#w7Y0{51Testing软件测试网KM7J8^}F,b]
    int value;
VK ftw,_,dn0    Node* next;
y5vK*{/\3Se"c0    Node( int v ) : value(v),next(0) {}
L+Ya#UX/G*J0};51Testing软件测试网E.ZTW)J.[1e
Node* head = 0;
w?V+B?-M$M$X#R0
!SH:b3M.Mv0void Pout( void )51Testing软件测试网&Ev"g GZHx3U6k&D7e,Q
{51Testing软件测试网pfG#R"YlC
    for( Node* p=head; p; p=p->next )
n Yb|Vh0        cout << p->value << ',';51Testing软件测试网9Q5a_B,P&x
    cout << "END"<< endl;51Testing软件测试网i$] r1~~d6B/^
}

?\6n!lt6b0_0
Q+txk!fWGs&i0void Reverse( void )51Testing软件测试网zAK:]*gC U
{
&^%B0{ea*c)`eA0    // 等同于for( Node *pre=0,*next; head&&(next=head->next,head->next=pre,next); pre=head,head=next )
`7g#^-J\M9[UKi0    for( register Node *phead=head,*pre=0,*next; head; )51Testing软件测试网*Oei!N J `
    {
t PjE7h:? k|E AH0        next = phead->next;51Testing软件测试网5v/E!@.Z$x"J,m
        phead->next = pre;
rzO$tt{0        if( !next )
yh;Y6}
i;x0        {51Testing软件测试网[ k^ j;u1{0@F
            head = phead;
)AiO$o#[0            break;51Testing软件测试网+cj!M*i"?pJ e(_VU
        }
"AosC/^av0        pre = phead;51Testing软件测试网2`W [1we.Bk
        phead = next;
1Tih)a8ix~&}"R0    }
8X!Hq ^"Xz:aU0}51Testing软件测试网/h,w/?;O"h/Y
51Testing软件测试网8dB/ldn
int main( void )51Testing软件测试网}!c*D1jN0f6oy
{
.t8Wa`4nCd8YK(I0    head = 0;
Zy(?`ho|q0    head = new Node(1);51Testing软件测试网#}k'i2q iwF&h3j
    head->next = new Node(2);51Testing软件测试网9Nv8w~8a)HB
    head->next->next = new Node(3);
zC+Yw(F
r2|+[JLH7z0    Pout();
[ uz?4N e(y'z0    Reverse();51Testing软件测试网"D Nz4A\v$hx
    Pout();51Testing软件测试网US#_5k:v*v
    // 内存释放与本主题无关
QFxC!|-zWb051Testing软件测试网.u(}
NZ+w"|f
    system("PAUSE");51Testing软件测试网Bmd M)WviW
    return 0;

Ti h;{z?0F's
Y$p0}51Testing软件测试网'j;N&gu$o+K
51Testing软件测试网3A0A~+R`aO

法二：

Mj,N h0` cD.t&u0void ListReverse(CLinkedList *pList)
~$["`i}"pa1U0{ 51Testing软件测试网!l ]/CS7N&F.[H'y$\
    TListNode *pPrior = NULL;
/tVS O4MSM-bC0    TListNode *pCurrent = NULL; 51Testing软件测试网3lM.q6|hF
    TListNode *tmpCurrent = pList ->pHead;
+V'm%~+wSN051Testing软件测试网&S ?mHe$S
    pList ->pTail = pList ->pHead;          /* 尾指针指向头结点 */ 51Testing软件测试网*S
YMaj mI
GI*w${
    while(NULL != tmpCurrent)
u2rCC,Y4D0    {                      
5f(M%y1}] L0        pCurrent = tmpCurrent;              /* 保存当前结点 */ 

T&SAK(U#t0        tmpCurrent = tmpCurrent -> pNext;   /* 保存当前结点的下一结点 */
9zq-t(C1I051Testing软件测试网A7HSRz
        pCurrent -> pNext = pPrior;         /* 当前结点指向前一结点 */
'A,c'm4v)X0        pPrior = pCurrent;                  /* 当前结点作为下次循环的前一结点 */ 51Testing软件测试网 f)uh@']4LJ
    } 51Testing软件测试网&[i&t5i2h7m1Hg4C
    pList ->pHead = pPrior;                 /* 头指针指向尾结点 */ 51Testing软件测试网8^k8`W,h7k5PRO}

sU:`V`0}
_ua"S}kyClI051Testing软件测试网2X} sl R7y'JY"ak

a*x6C8ddd7v'S0法三：

link reverse(link x)
9dsL k/V`
F;^0{ link t,y=x,r=0; 51Testing软件测试网 b8[0a"w,G$l
while(y!=0)
#d9qO1\Lf0{t=y->next;y->next=r;r=y;y=t;} 51Testing软件测试网SG&N-i9RU4RO|,_ pP.nd
return r;
4jh.s)M&r)i1RD0}

0F4RC$q)K(H \0