链表相邻元素反转

三指针问题

#include <stdio.h>
#include <malloc.h>

typedef struct Listnode
{
	int num;
	struct Listnode *next;
}Listnode,*pListnode;

void create_list(pListnode *head, int n)
{
	int i;
	pListnode p,q;
	for(i=1;i<=n;i++)
	{
		p = (pListnode)malloc(sizeof(Listnode));
		if(!p)
		{
			printf("创建空间失败!\n");
			return;
		}
		p->num = i;
		p->next = NULL;
		if(i==1)
		{
			*head = p;
			q = p;
		}
		else
		{
			q->next = p;
			q = p;
		}
		
	}
}

void reverse(pListnode *head)
{
	if(*head == NULL || (*head)->next == NULL)
		return;
	pListnode pre = NULL;
	pListnode curr = *head;
	pListnode next = NULL;
	while(curr!=NULL && curr->next!=NULL)
	{
		if(pre)
			pre->next = curr->next;
		else
			*head = curr->next;
		pre = curr;
		next = curr->next->next;
		curr->next->next = curr;
		curr->next = next;
		curr = next;
	}
}

int main()
{
	pListnode head = NULL,temp;
	int n = 7;
	create_list(&head,n);
	printf("链表节点为:\n");
	temp = head;
	while(temp)
	{
		printf("%d\t",temp->num);
		temp = temp->next;
	}
	printf("\n");
	reverse(&head);
	printf("相邻节点反转后的链表节点为:\n");
	temp = head;
	while(temp)
	{
		printf("%d\t",temp->num);
		temp = temp->next;
	}
	printf("\n");
	return 0;
}