11.P56课后习题2-18：编写算法实现单链表head的就地逆置，即要求利用原单链表的结点空间，把数据元素序列(a0,a1,...,an-1)逆置为(an-1,...,a1,a0)。

11.P56课后习题2-18：编写算法实现单链表head的就地逆置，即要求利用原单链表的结点空间，把数据元素序列(a0,a1,…,an-1)逆置为(an-1,…,a1,a0)。

头文件：LinList.h

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

typedef int DataType;

typedef struct Node
{
	DataType data;
	struct Node* next;
}SLNode;

void ListInitiate(SLNode** head)
{
	*head = (SLNode*)malloc(sizeof(SLNode));
	(*head)->next = NULL;
}

int ListLength(SLNode* head)
{
	SLNode* p = head;
	int size = 0;
	while (p->next != NULL)
	{
		p = p->next;
		size++;
	}
	return size;
}

int ListInsert(SLNode* head, int i, DataType x)
{
	SLNode* p, * q;
	int j;
	p = head;
	j = -1;
	while (p->next != NULL && j < i - 1)
	{
		p = p->next;
		j++;
	}
	if (j != i - 1)
	{
		printf("插入位置参数错!");
		return 0;
	}
	q = (SLNode*)malloc(sizeof(SLNode));
	q->data = x;
	q->next = p->next;
	p->next = q;
	return 1;
}

int ListDelete(SLNode* head, int i, DataType* x)
{
	SLNode* p, * s;
	int j;
	p = head;
	j = -1;
	while (p->next != NULL && p->next->next != NULL && j < i - 1)
	{
		p = p->next;
		j++;
	}
	if (j != i - 1)
	{
		printf("删除元素位置参数错!");
		return 0;
	}
	s = p->next;
	*x = s->data;
	p->next = p->next->next;
	free(s);
	return 1;
}

int ListGet(SLNode* head, int i, DataType* x)
{
	SLNode* p;
	int j;
	p = head;
	j = -1;
	while (p->next != NULL && j < i)
	{
		p = p->next;
		j++;
	}
	if (j != i)
	{
		printf("取元素位置参数错!");
		return 0;
	}
	*x = p->data;
	return 1;
}

void Destroy(SLNode** head)
{
	SLNode* p, * p1;
	p = *head;
	while (p != NULL)
	{
		p1 = p;
		p = p->next;
		free(p1);
	}
	*head = NULL;
}

源文件：单链表的就地逆置.c

#include"LinList.h"

void Converse(SLNode **head)
{
	SLNode* p, * q;
	p = (*head)->next;
	(*head)->next = NULL;
	while (p != NULL)
	{
		q = p;
		p = p->next;
		q->next = (*head)->next;
		(*head)->next = q;
	}
}

int main()
{
	SLNode* head;
	int i, x;

	ListInitiate(&head);

	for (i = 0; i < 10; i++)
		ListInsert(head, i, i + 1);

	printf("就地逆置前的单链表为：");
	for (i = 0; i < ListLength(head); i++)
	{
		ListGet(head, i, &x);
		printf("%d ", x);
	}

	Converse(&head);

	printf("\n就地逆置后的单链表为：");
	for (i = 0; i < ListLength(head); i++)
	{
		ListGet(head, i, &x);
		printf("%d ", x);
	}

	Destroy(&head);

	return 0;
}