单链表的创建、取数据、数据添加、数据插入、数据删除

最新推荐文章于 2023-12-23 21:19:39 发布

研途路

最新推荐文章于 2023-12-23 21:19:39 发布

阅读量824

点赞数

CC 4.0 BY-SA版权

本文链接：https://blog.youkuaiyun.com/LPVeneno/article/details/53364423

本文介绍了一种使用C++实现单链表的基本操作方法，包括通过头插法和尾插法创建单链表，以及如何获取、插入和删除单链表中的元素。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <cstdio>
#include<cstdlib>
#include <time.h>
#define OK 1
#define ERROR 0
#define TRUE 1
#define FALSE 0
using namespace std;
typedef int ElemType;
typedef struct Node
{
	ElemType data;
	struct Node* Next;
}Node;
typedef struct Node* LinkList;
//头插法建立单链表
void CreateListHead(LinkList *L, int n)
{
	LinkList p;
	int i;

	srand(time(0));

	*L = (LinkList)malloc(sizeof(Node));
	(*L)->Next = NULL;
	for (int i = 0; i < n; i++)
	{
		p = (LinkList)malloc(sizeof(Node));
		p->data = rand() % 100 + 1;//零到一百的自然数
		p->Next = (*L)->Next;
		(*L)->Next = p;
	}
}
//尾插法建立单链表
void CreateListTail(LinkList *L, int n)
{
	LinkList p, r;
	int i;

	srand(time(0));

	*L = (LinkList)malloc(sizeof (Node));

	for (int i = 0; i < n; i++)
	{
		p = (Node *)malloc(sizeof(Node));
		p->data = rand() % 100 + 1;
		r->Next = p;
		r = p;
	}
}
//用e返回单链表L第i个元素
ElemType GetElem(LinkList L, int i, ElemType*e)
{
	int j;
	LinkList p=L->Next;
	j = 1;
	//查找第i个元素
	while (p&&j<i)
	{
		p = p->Next;
		++j;
	}
	if (!p || j > i)
	{
		return ERROR;
	}
	*e = p->data;
	return OK;
}
//单链表元素的插入
ElemType ListInsert(LinkList *L, int i, ElemType e)
{
	int j;
	LinkList p, s;
	p = *L;
	j = 1;
	//查找第i个元素
	while (p&&j<i) 
	{
		p = p->Next;
		j++;
	}
	if (!p||j>i)
	{
		return ERROR;
	}
	s = (LinkList)malloc(sizeof(Node));
	s->data = e;
	s->Next = p->Next;
	p->Next = s;
	return OK;
}
//单链表元素的删除
ElemType ListDelete(LinkList *L, int i, ElemType *e)
{
	int j;
	LinkList p = *L;
	j = 1;
	while (p->Next&&j < i)
	{
		p = p->Next;
		j++;
	}
	//找不到元素或者到了表尾
	if (!(p->Next)&&j>i )
	{
		return ERROR;
	}
	p = p->Next->Next;
	*e = p->Next->data;
	free(p->Next);
	return OK;
}

#define _CRT_SECURE_NO_WARNINGS#include <iostream>#include <cstdio>#include<cstdlib>#define OK 1#define ERROR 0#define TRUE 1#define FALSE 0using namespace std;typedef int ElemType;typedef struct Node{ElemType data;struct Node* Next;}Node;typedef struct Node* LinkList;//用e返回单链表L第i个元素ElemType GetElem(LinkList L, int i, ElemType*e){int j;LinkList p=L->Next;j = 1;//查找第i个元素while (p&&j<i){p = p->Next;++j;}if (!p || j > i){return ERROR;}*e = p->data;return OK;}//单链表元素的插入ElemType ListInsert(LinkList *L, int i, ElemType e){int j;LinkList p, s;p = *L;j = 1;//查找第i个元素while (p&&j<i) {p = p->Next;j++;}if (!p||j>i){return ERROR;}s = (LinkList)malloc(sizeof(Node));s->data = e;s->Next = p->Next;p->Next = s;return OK;}//单链表元素的删除ElemType ListDelete(LinkList *L, int i, ElemType *e){int j;LinkList p = *L;j = 1;while (p->Next&&j < i){p = p->Next;j++;}//找不到元素或者到了表尾if (!(p->Next)&&j>i ){return ERROR;}p = p->Next->Next;*e = p->Next->data;free(p->Next);return OK;}