预置代码题目中已给出
#include <iostream>
using namespace std;
typedef int ElemType;
typedef struct node
{ ElemType data;
struct node * next;
} NODE;
typedef NODE * LinkList;
void output( LinkList );
void change( int, int, NODE * );
LinkList createList( ElemType );
void inverse( LinkList );
LinkList createList( ElemType finish ) //finish:数据结束标记
{
ElemType x;
NODE *newNode;
LinkList first = new NODE; // 建立头结点
first->next = NULL;
first->data = finish;
cin >> x; // 约定以finish结束连续输入
while ( x != finish )
{
newNode = new NODE; // 建立新结点
newNode->data = x;
newNode->next = first->next; // ①
first->next = newNode; // ②
cin >> x;
}
return first;
}
void output( LinkList head )
{ cout << "List:";
while ( head->next != NULL )
{ cout << head->next->data << ",";
head = head->next;
}
cout << endl;
}
int main(int argc, char** argv)
{
LinkList head;
head = createList( -1 );
output( head );
inverse( head );
output( head );
return 0;
}
以下函数为实现逆序操作
void inverse( LinkList head )
{//实现指针的逆转
LinkList p,q;
p=head->next;//首先操作head的下一个节点
head->next=NULL;
while(p!=NULL)
{
q=p->next;
p->next=head->next;//p是跟在head后面的第一个
head->next=p;//q是紧跟着q的
p=q;
}
}