# 逆置链式链表(线性表)

（线性表）试编写算法将线性表就地逆置，以链式存储结构实现。

#include <stdio.h>
#include <malloc.h>
struct Num
{
int n;
struct Num *next;
}num;
{
struct Num *p;
{
}
}
int main()
{
return 0;
}
struct Num *createlist(struct Num *head)                //头插法建立链表
{
struct Num *p;
p=(struct Num*)malloc(sizeof(struct Num));            //p建立新结点
while(scanf("%d",&p->n)!=EOF)                      //将新结点插到开头的位置
{
/***************/
添加代码
/*****************/
p=(struct Num*)malloc(sizeof(struct Num));         //p每次建立新结点
}
}
{
while(current!=NULL)
{
printf("%d ",current->n);
current=current->next;
}
}

1 2 3 4 5 6 7 8 9

9 8 7 6 5 4 3 2 1

``10 23 56 89 11``

``11 89 56 23 10 ``

``````#include<iostream>
using namespace std;
struct line
{
int num;
line *next;
};
line *creat()
{
line *p;
while(cin>>p->num)
{
p->next=new line;
p=p->next;

}
p->next=NULL;
}
{
line *pFront,*pRear,*p;
p=p->next;
pFront->next=NULL;
pRear=p->next;
p->next=pFront;
while(pRear)
{
pFront=p;
p=pRear;
pRear=p->next;
p->next=pFront;
}
}
{
{
}
}
int main()
{
return 0;

}``````

``````#include<stdio.h>
#include<malloc.h>
#define NULL 0
#define LEN sizeof(struct date)

int t,m=0;
struct date
{
int num;
struct date *next;
};
struct date * creat()
{
struct date *p1,*p2;
t=0;
p1=p2=(struct date *)malloc(LEN);
while(scanf("%d",&p1->num)!=EOF)
{
t++;
m++;
if(t==1)
else
p2->next=p1;
p2=p1;
p1=(struct date *)malloc(LEN);
}
p2->next=NULL;
}
{
struct date *p;
do
{
printf("%d ",p->num);

p=p->next;
}while(p!=NULL);
printf("\n");
}

int main()
{
struct date *p,*p3,*p4,*p5;
p3=creat();
p=p3;
p4=p;
p=p->next;
while(p)
{
p3=p4;
p4=p;
p5=p->next;
p4->next=p3;
p=p5;
}
p=p4;
while(m--)
p=p->next;
p->next->next=NULL;
print(p4);
return 0;
}``````