資源簡介
給定一個不帶頭結點的單鏈表,寫出將鏈表倒置的算法
代碼片段和文件信息
#include???
using???namespace???std;
#define?N?10
class???node
{
public:
????????node(int???x):data(x)next(0){}
????????int???data;
????????node*???next;
};
node*???ReverseList(node*???head)
{
????????node*???p=0;
????????node*???q=head;
????????while(head->?next!=0)
????????{
????????????????p=head->?next;
????????????????head->?next=p->?next;
????????????????p->?next=q;
????????????????q=p;
????????}
????????return
評論
共有 條評論