链表（最新）—c语言实现

#include <stdio.h>
#include <math.h>
#include <stdlib.h>
#define _CRT_SECURE_NO_WARNINGS
#pragma warning(disable:4996)

#define MAX 100

struct Link {
	int data;
	struct Link* next;
};

//链表操作，只需要初始化传回指针
//改动链表操作，都需要返回指针
//函数传递都采用指针传递 struct Link* L

struct Link* Init(struct Link* L);                //初始化顺序表
void HSert(struct Link* L, int e);				  //在链表的最后加入数据
void Sert(struct Link* L, int i, int e);		  //在链表的第i个位置加入数据e
void bianli(struct Link *L);					  //遍历链表
void Delect(struct Link* L, int i);				  //删除表中指定位置数据
int Get(struct Link* L, int i);					  //得到第i个值
int Locate(struct Link* L, int e);				  //数据e在哪个位置
int Len(struct Link* L);						  //取得链表长度

int main()
{
	int i = 0, j = 0;
	struct Link* L = NULL;
	L=Init(L);
	HSert(L, 1);
	HSert(L, 2);
	HSert(L, 3);
	bianli(L);
	int size = 0;
	size = Len(L);
	printf("链表长度为 = %d\n", size);
	printf("\n");
	printf("\n");
	Sert(L, 2, 5);
	bianli(L);
	printf("\n");
	printf("\n");
	Delect(L, 2);
	bianli(L);
	printf("\n");
	printf("\n");
	i=Get(L, 2);
	printf("第二个位置的值是 = %d\n", i);
	j=Locate(L, 3);
	printf("数据3的位置为 = %d\n", j);
	return 0;
}

struct Link* Init(struct Link* L)
{
	L = (struct Link*)malloc(sizeof(struct Link));
	L->next = NULL;
	if (L == NULL)
	{
		printf("初始化失败\n");
		exit(0);
	}
	else
	{
		printf("初始化成功\n");
		return L;
	}
}

void HSert(struct Link* L, int e)
{
	struct Link* p = NULL, * q = L;
	p = (struct Link*)malloc(sizeof(struct Link));
	p->next = NULL;
	p->data = e;
	while (q->next!=NULL)
	{
		q = q->next;
	}
	q->next = p;
}

void bianli(struct Link* L)
{
	struct Link* p = L;
	while (p->next)
	{
		p = p->next;
		printf("表中数据为 = %d\n",p->data);
	}
}

void Sert(struct Link* L, int i, int e)
{
	int size = 0, j = 0;
	size = Len(L);
	if (i<1 && i>size)
	{
		exit(0);
	}
	struct Link* p = NULL, * q = L;
	p = (struct Link*)malloc(sizeof(struct Link));
	p->next = NULL;
	p->data = e;

	for (j = 1; j < i; j++)
	{
		q = q->next;
	}
	p->next = q->next;
	q->next = p;
}

int Len(struct Link* L)
{
	struct Link* p = L;
	int size = 0;
	while (p->next != NULL)
	{
		p = p->next;
		size++;
	}
	return size;
}

void Delect(struct Link* L, int i)
{
	int size = 0, j = 0;
	size = Len(L);
	if (i<1 && i>size)
	{
		exit(0);
	}
	struct Link* p = NULL, * q = L;
	for (j = 1; j < i; j++)
	{
		q = q->next;
	}
	p = q->next;
	q->next = p->next;
	free(p);
}

int Get(struct Link* L, int i)
{
	int size = 0, j = 0, data = 0;
	size = Len(L);
	if (i<1 && i>size)
	{
		exit(0);
	}
	struct Link* p = L;
	for (j = 1; j <= i; j++)
	{
		p = p->next;
	}
	data = p->data;
	return data;
}

int Locate(struct Link* L, int e)
{
	struct Link* p = L;
	int count = 0;
	while ((p->data != e)&&p)
	{
		p = p->next;
		count++;
	}
	if (p != NULL)
	{
		return count;
	}
	else
	{
		printf("没找到\n");
		exit(0);
	}
}