链表--创建、打印、插入、删除、找出倒数第K个元素、反转、寻找中间节点、冒泡排序

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

//定义链表
typedef struct ListNode
{
	int data;
	struct ListNode *next;
}linklist;

linklist *head = NULL;

//创建链表
linklist*CreateList(int *arr, int len)
{
	linklist* p, *rear;
	head = (linklist*)malloc(sizeof(linklist));
	rear = head;
	int count = 0;
	while (count < len)
	{
		p = (linklist*)malloc(sizeof(linklist));
		p->data = arr[count];
		rear->next = p;
		rear = p;
		count++;
	}
	rear->next = NULL;
	return head;
}


//单链表插入
void InsertList(linklist *head, int x,int i)
{
	linklist *p = head->next;
	int j = 1;
	while (p&&j < i)
	{
		p = p->next;
		++j;
	}
	if (!p || j > i)
	{
		printf("Position Error");
	}
	linklist *s = (linklist*)malloc(sizeof(linklist));
	s->data = x;
	s->next = p->next;
	p->next = s;
}
//删除节点
void DeleteList(linklist *head, int i)
{
	linklist *p, *r;
	p = head;
	int j = 1;
	while (p &&j < i)
	{
		p = p->next;
		j++;
	}
	if (p->next == NULL || j > i)
	{
		printf("Position Error");
		return -1;
	}
	r = p->next;
	p->next = r->next;
	free(r);
}
//删除头元素
void DeleteHeadList(linklist *head)
{
	linklist *p;
	p = head->next;
	head->next = p->next;
	free(p);
}
//找出链表中倒数第K个元素,定义两个指针，一个比另一个先移动K-1
//再同时移动两个指针，当快的那个指针为空时，慢的指针就在倒数第K个节点上；
void FindTheKList(linklist* head, int k)
{
	linklist *p1, *p2;
	p1 = p2 = head;
	for (int j = 1;j < k;j++)
		p1 = p1->next;
	while (p1->next != NULL)
	{
		p1 = p1->next;
		p2 = p2->next;
	}
	printf("链表中倒数第%d个元素是：%d\n",k, p2->data);
}
//链表逆序 
linklist* ReverseList(linklist *pHead)
{
	linklist *head, *pNext, *pPre;
	linklist *ReverseHead=NULL;
	pPre = NULL;
	head = pHead->next;
	while (head != NULL)
	{
		pNext = head->next;
		if (pNext == NULL)
			ReverseHead = head;
		head->next = pPre;
		pPre = head;
		head = pNext;
	}
	return ReverseHead;
	printf("\n");
}
//找出链表中间结点元素
void FindMid(linklist *head)
{
	linklist *fast, *slow;
	fast = head;
	slow = head;
	while (fast != NULL && fast->next != NULL && fast->next->next != NULL)
	{
		fast = fast->next->next;
		slow = slow->next;
	}
	printf("链表中间元素是:%d\n ", slow->data);
}
//冒泡排序
void BubbleSortList(linklist *ReverseHead)
{
	linklist *p1 = NULL; 
	linklist *p2 = NULL;
	int temp;
	for(p1=ReverseHead;p1->next;p1=p1->next)
		for (p2 = ReverseHead;p2->next;p2 = p2->next)
		{
			if ((p2->data) > (p2->next->data))
			{
				temp = p2->data;
				p2->data = p2->next->data;
				p2->next->data = temp;
			}
		}
	
}
//打印链表
void ShowList(linklist* p)
{
	printf("链表元素为：");
	while (p)
	{
		printf("%d ", p->data);
		p = p->next;
	}
	printf("\n");
}

//主函数
int main()
{
	int array[] = { 1,3,5,7,9,2,4,6,8,10};
	CreateList(array, sizeof(array) / sizeof(array[0]));
	ShowList(head->next);
	
	InsertList(head, 100, 3);
	ShowList(head->next);
	
	DeleteList(head, 4);
	ShowList(head->next);
	
	DeleteHeadList(head);
	ShowList(head->next);
	
	FindTheKList(head,7);
	
	linklist *ReverseHead =  ReverseList(head);
	printf("逆序后");
	ShowList(ReverseHead);
	
	BubbleSortList(ReverseHead);
	ShowList(ReverseHead);

	
	return 0;
}