题目描述
本题只需要提交填写部分的代码
(线性表)试编写算法将线性表就地逆置,以链式存储结构实现。
代码:
#include <stdio.h>
#include <malloc.h>
struct Num
{
int n;
struct Num *next;
}num;
struct Num *createlist(struct Num *head);
void print(struct Num *head);
void destroy(struct Num *head);
void destroy(struct Num *head)
{
struct Num *p;
while(head!=NULL)
{
p=head->next;
delete(head);
head=p;
}
}
int main()
{
struct Num *head=NULL;
head=createlist(head); //建立
print(head);//输出
destroy(head);
return 0;
}
struct Num *createlist(struct Num *head) //头插法建立链表
{
struct Num *p;
p=head=(struct Num*)malloc(sizeof(struct Num));
head=NULL;
p=(struct Num*)malloc(sizeof(struct Num)); //p建立新结点
while(scanf("%d",&p->n)!=EOF) //将新结点插到开头的位置
{
/***************/
添加代码
/*****************/
p=(struct Num*)malloc(sizeof(struct Num)); //p每次建立新结点
}
return head;
}
void print(struct Num *head)
{
struct Num *current=head;
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<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 *head;
struct date *p1,*p2;
t=0;
p1=p2=(struct date *)malloc(LEN);
head=NULL;
while(scanf("%d",&p1->num)!=EOF)
{
t++;
m++;
if(t==1)
head=p1; else
p2->next=p1;
p2=p1;
p1=(struct date *)malloc(LEN);
}
p2->next=NULL;
return (head);
}
void print(struct date *head)
{
struct date *p;
p=head;
if(head!=NULL)
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;
}
解析
暂无