#include <stdio.h>
#include<stdlib.h>
//结点类型定义
typedef struct Node{
int a;
struct Node *next;
}Node,*Linklist;
Linklist listInit(int *data,int n){
Linklist head,p,q;
int i;
head=(Node *)malloc(sizeof(Node));
p=head;
for(i=0;i<n;i++){
q=(Node *)malloc(sizeof(Node));
q->a=data[i];
p->next=q;
p=q;
}
q->next=NULL;
return head;
}
//倒置
void listdaozhi(Linklist head){
int tdata;
Linklist p ,q,t;
p=head->next;
if(!p)return;
q=p->next;
if(!q)return;
t=q->next;
if(!t){
tdata=p->a;
p->a=q->a;
q->a=tdata;
return;
}
p->next=NULL; //否则不断
while (t!=NULL) {
q->next=p;
head->next=q;
p=q;
q=t;
t=t->next;
}
head->next=q;
q->next=p;
}
void listshow(Linklist head){
int i=0;
Linklist p;
p=head->next;
while (p!=NULL) {
if(i!=0)printf(" “);
printf(”%d",p->a);
p=p->next;
i++;
}
printf("\n");
}
int main() {
Linklist head;
int n;
int i;
int a[100];
printf("请输入插入个数:");
scanf("%d",&n);
printf("请继续输入:");
for(i=0;i<n;i++){
scanf("%d",&a[i]);
}
head=listInit(a, n);
listdaozhi(head);
listshow(head);
return 0;
}