数据结构例28.将单链表中的元素逆置

/*
已知单链表la={a1,a2,…an}，试编写一个算法，
将la中的元素进行逆置，即la={an,an-1,…a1}
*/

# include <iostream>
# include <stdlib.h>
# include <stdio.h>
using namespace std;


typedef struct Node
{
    int elem;
    struct  Node *next;
}*Linklist;
void inlinklist(Linklist &l, int n)
{
    l = (Linklist)malloc(sizeof(Node));
    l->next = NULL;
    Linklist p, END;//定义尾部节点
    END = l;
    printf("请输入想要创建的链表元素:\n");
    for(int i = 0; i < n; i++)
    {
        p = (Linklist)malloc(sizeof(Node));
        scanf("%d", &p->elem);
        END -> next = p;
        p->next = NULL;
        END = p;
    }
}
void outlinklist(Linklist l)
{
    printf("链表中的值为:\n");
    Linklist  p;
    p = l->next;
    while(p != NULL)
    {
        printf("%d ", p->elem);
        p = p->next;
    }
	printf("\n");
}

//在做一次头插
void transpose(Linklist &l)
{
	Linklist p, q;
	p = l->next;
	l->next = NULL;

	while(p)
	{
		q = p;
		p = p->next;
		q->next = l->next;
		l->next = q;
	}
}

```cpp
int main()
{
	Linklist l;
	int n;

	printf("请输入链表的元素个数:\n");
	scanf("%d", &n);

	inlinklist(l, n);
	transpose(l);
	outlinklist(l);

	return 0;
}