逆秩链表

如题，代码如下：

#include <stdio.h>
#include <stdlib.h>
//链表类型
typedef struct list_t
{
int data;
struct list_t *next;
}list_t;

list_t *create_list (int n);
void print_list (list_t *head);
list_t *reverse_list(list_t *head);
int main(int argc, char *argv[])
{
int n = 0;
list_t *head = NULL;

scanf("%d", &n);

head = create_list(n);

printf("逆秩之前:\n");

print_list(head);

head = reverse_list(head);

printf("\n逆秩之后:\n");

print_list(head);

printf("\n");

return 0;
}

//创建链表
list_t *create_list(int n)
{
list_t *list_node = NULL;

if (n > 0) {
list_node = (list_t *)malloc(sizeof(list_t));
if (!list_node) {
perror("memory is full!");
exit(-1);
}
scanf("%d", &list_node->data);
list_node->next = create_list(n - 1);
}

return list_node;
}
//递归正向输出
void print_list(list_t *head)
{
if (head) {
printf("%d ", head->data);
print_list(head->next);
}
}
//逆秩链表
list_t *reverse_list(list_t *head)
{
list_t *p = NULL;
list_t *q = NULL;

//链表为空
if (!head) {
return head;
}
/*进行逆秩*/

//取出节点
p = head;

while (p) {
//head后移一个
head = p->next;
//将p所指向的单元链接到新链
p->next = q;
//q指向新链起始
q = p;
//p继续指回旧链
p = head;

}

return q;
}