//题目:反转单链表
//描述:给定一个单链表的头节点 head,请将该链表反转,并返回反转后的链表头节点。
//要求:需要原地反转链表,即不使用额外的数据结构。
//
//示例:
//输入:1 -> 2 -> 3 -> 4 -> 5
//输出:5 -> 4 -> 3 -> 2 -> 1
#include<stdio.h>
#include<stdlib.h>
#define maxsize 100
typedef int elemtype;
typedef struct lnode
{
elemtype date;
struct lnode* next;
}lnode,*linklist;
void creatlist(linklist* list)
{
int x=0;
linklist s;
linklist head = (linklist)malloc(sizeof(lnode));
head->next = NULL;
*list = head;
scanf_s("%d", &x);
while (x != -1)
{
s = (linklist)malloc(sizeof(lnode));
s->date = x;
s->next = head->next;
head->next = s;
scanf_s("%d", &x);
}
}
void printlist(linklist list)
{
linklist p;
p = list->next;
while (p != NULL)
{
printf("%d ", p->date);
p=p->next;
}
}
int main()
{
linklist list = (linklist)malloc(sizeof(lnode));
creatlist(&list);
printlist(list);
return 0;
}