CPP实现单链表

LinkList.cpp

#include"List.h"

using namespace std;

typedef struct Lnode
{
	int data;
	Lnode* next;
}Londe, * LinkList;

//Initailize LinkList
Status InitList_L(LinkList& L)
{
	L = new Lnode;
	L->next = NULL;
	return OK;
}
 
//Is empty?
Status IsEmpty(LinkList& L)
{
	if (L->next)return FALSE;
	else return TURE;
}

//Destory LinkList
Status DestoryLinkList(LinkList& L)
{
	while (L)
	{
		Lnode* P;
		P = L;
		L = L->next;
		delete P;
	}
	return OK;
}

//Clear LinkList
Status ClearList(LinkList& L)
{
	Lnode* q, * p;
	p = L->next;
	while (p)
	{
		q = p->next;
		delete p;
		p = q;
	}
	L->next = NULL;
	return OK;
}

//Get the length of LinkList
int ListLength_L(LinkList L)
{
	LinkList p;
	p = L->next;
	int i = 0;
	while (p)
	{
		i++;
		p = p->next;
	}
	return i;
}

//Get the value of Lnode
Status GetElem(LinkList L, int i, int& e)
{
	Lnode* p;
	p = L->next;
	int j = 1;
	while (p && j < i)
	{
		p = p->next;
		++j;
	}
	if (!p || j > i) return ERROR;
	e = p->data;
	return OK;
}

//Locate the element
Lnode* LocateElem(LinkList L, int e)
{
	Lnode* p;
	p = L->next;
	while (p && p->data != e)
		p = p ->next;
	return p;
}

//Delete Lnode
Status LnodeDelete(LinkList& L, int i, int e)
{
	Lnode* p, * q;
	p = L;
	int j = 0;
	while (p->next && j < i - 1)
	{
		p = p->next;
		++j;
	}
	if (!p->next || j > i - 1)return ERROR;
	q = p->next;
	p->next = q->next;
	delete q;
	return OK;
}

//创建链表--前插法
void CreadList_H(LinkList& L, int n)
{
	L = new Lnode;
	Lnode* p;
	L->next = NULL;//先建立一个带头结点的单链表
	for (int i = n; i > 0; --i)
	{
		p = new Londe;//生成新的结点
		cin >> p->data;//新结点的元素值
		p->next = L->next;
		L->next = p;
	}
}

//创建链表--尾插法
void CreatList_R(LinkList& L, int n)
{
	L = new Lnode;
	L->next = NULL;
	Lnode* r, * p;
	r = L;
	for (int i = 0; i < n; ++i)
	{
		p = new Lnode;
		cin >> p->data;
		p->next = NULL;
		r->next = p;//插入到表尾
		r = p;//r指向新的尾结点
	}
}

//带尾指针的链表合并
LinkList Connect(LinkList Ta, LinkList Tb)
{
	Lnode* p;
	p = Ta->next;
	Ta->next = Tb->next;
	delete Tb->next;
	Tb->next = p;
	return Tb;
}


int main()
{
	return 0;
}

List.h

#pragma once
#include<iostream>

#define TURE 1
#define FALSE 0
#define OK 1
#define ERROR 0
#define INFEASIBLE -1
#define OverFlow -2
#define MAXSIZE 100
#define Status int

标签：单链,return,Lnode,int,next,LinkList,CPP,无类,define
来源： https://blog.csdn.net/weixin_47610359/article/details/122598542