链表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* Init(struct Link* head);
void Getelem(struct Link head, int i);    //第i个元素是什么
void Locate(struct Link head, int e);		//查找元素e
struct Link* Sert(struct Link* head, int i, int e);		//在i位置插入元素e
struct Link* Delete(struct Link* head, int i);			//删除i位置的元素
struct Link* En(struct Link* head, int e);    //放入数据
void bianli(struct Link* head);

int main()
{
	int i = 0, e = 0;
	struct Link *L=NULL;
	L=Init(L);
	if (L->next == NULL)
	{
		printf("表初始化成功aaaaaaaaaaaaa\n");
	}
	while (e != -1)
	{
		printf("请输入数据，-1表示结束\n");
		scanf("%d", &e);
		if (e != -1)
		{
			En(L, e);
		}
	}
	bianli(L);
	return 0;
}

struct Link* Init(struct Link* head)
{
	head = (struct Link*)malloc(sizeof(struct Link));

	head->next = NULL;
	if (head == NULL)
	{
		printf("表初始化失败1231\n");
	}
	else
	{
		printf("表初始化成功1231\n");
	}
	if (head->next == NULL)
	{
		printf("表初始化成功\n");
	}
	return head;
}

void Getelem(struct Link head, int i)
{
	int e = 0,j=0;
	struct Link* p = &head;
	while (p && j < i)
	{
		p = p->next;
		j++;
	}
	if (!p || j > i)exit(0);
	e = p->data;
	printf("第 %d 个数据为 %d \n", i, e);
}

void Locate(struct Link head, int e)
{
	struct Link* p = &head;
	while (p && p->data != e)
	{
		p = p->next;
	}
}

struct Link* Sert(struct Link* head, int i, int e)
{
	struct Link* p = head;
	int j = 0;
	while (p && (j < i - 1))
	{
		p = p->next;
		j++;
	}
	if (!p || j > i - 1)
	{
		exit(0);
	}
	struct Link* q = NULL;
	q = (struct Link*)malloc(sizeof(struct Link));
	q->data = e;
	q->next = NULL;
	q->next = p->next;
	p->next = q;
}

struct Link* Delete(struct Link* head, int i)
{
	struct Link* p = head;
	int j = 0;
	while ((p->next) && (j < i - 1))
	{
		p = p->next;
		j++;
	}
	if (!(p->next) || (j > i - 1))exit(0);
	struct Link* q = p;
	q = q->next;
	p->next = q->next;
	free(q);
}

struct Link* En(struct Link* head, int e)
{
	struct Link* p = NULL, * q = head;
	p = (struct Link*)malloc(sizeof(struct Link));
	p->data = e;
	p->next = NULL;
	while (q->next != NULL)
	{
		q = q->next;
	}
	q->next = p;
	printf("数据入表成功\n");
}

void bianli(struct Link* head)
{
	struct Link* p = head;
	int i=0;
	while (p->next)
	{
		p = p->next;
		i++;
		printf("第 %d 个数据为 %d \n", i, p->data);
	}
}