实现链表逆序

建立一个带头结点的链表实现链表倒序

#include <stdio.h>
#include <stdlib.h>

struct node
{
	int num;
	struct node *next;
};

typedef struct node Node;
typedef Node * Link;

void creat_list(Link *head)
{
	*head = (Link)malloc(sizeof(Node));

	if(!(*head))
	{
		printf("malloc error!\n");
		exit(-1);
	}

	(*head)->next = NULL;
}

void insert_tail(Link *head)
{
	Link temp = *head;
	Link p;
	int i;
	
	while(temp->next != NULL)
	{
		temp = temp->next;
	}

	for(i = 1; i < 11; i++)
	{
		p = (Link)malloc(sizeof(Node));

		if(!p)
		{
			printf("malloc error!\n");
			exit(-1);
		}

		p->num = i;
		temp->next = p;
		p->next = NULL;
		temp = p;
	}
}

void inverted(Link *head)
{
	Link p1,p2,p3;
	p1 = (*head)->next;

	if(p1 != NULL)
	{
		p2 = p1->next;

		if(p2 != NULL)
		{
			if(p2->next == NULL)
			{
				p2->next = (*head)->next;
				(*head)->next = p2;
				p1->next = NULL;
			}
			else
			{
				p3 = p2->next;

				while(p3 != NULL)
				{
					p2->next = p1;
					p1 = p2;
					p2 = p3;
					p3 = p3->next;
				}

				p2->next = p1;
				(*head)->next->next = NULL;
				(*head)->next = p2;

			}
		}
	}
}

void display(Link head)
{
	Link temp;
	temp = head->next;

	while(temp != NULL)
	{
		printf("num = %d\n",temp->num);
		temp = temp->next;
	}
}

int main()
{
	Link head;

	creat_list(&head);
	insert_tail(&head);
	display(head);
	inverted(&head);
	display(head);

    return 0;
}