Initial knowledge of data linked list

Simple implementation of data linked list

notes ：

• Compile environment vs2019;
• For beginners , Big guys don't have to waste their time reading ;
• If you have any questions, please leave a message or private letter to discuss ;

First of all, we need to know the basic structure of the data linked list

• Three basic quantities are written in my linked list ： Capacity , Current capacity , The pointer
• The following functions are realized ： Additions and deletions
• Understand a knowledge point ： The pointer can be changed into a variable through dynamic memory application

structured ：

function.p Code snippet in

enum TwoInformation {
     ERROR = -1, OK = 1 };
// Define enumeration types , Convenient error finding 

typedef struct myList
{
    
	int Capacity;
	int cur_Size;

	int* p_MyArr;
}MYLIST, * p_MyList;

p_MyList createList(int);
int AddLData(p_MyList& p, int data);
int delData(p_MyList& p, int);
void show(p_MyList& p);
int Empty(p_MyList& p);
int getSize(p_MyList& p);
int lookup(p_MyList& p,int );
int modify(p_MyList& p, int, int);

function.cpp In the code （ The concrete realization of function ）：

#include<iostream>
#include<assert.h>
#include"function.h"

using namespace std;

p_MyList createList(int max_Size)
{
    
	p_MyList plist = (p_MyList)malloc(sizeof(MYLIST));
	assert(plist);
	// About assert The function is probably used to see whether the memory application is successful , Search by yourself 

	plist->cur_Size = 0;
	plist->Capacity = max_Size;
	plist->p_MyArr = (int*)malloc(sizeof(int) * max_Size);
	assert(plist->p_MyArr);

	return plist;
}

int AddLData(p_MyList& p, int data)
{
    
	if (p->cur_Size >= p->Capacity)
	{
    
		cout << "List is full!" << endl;
		return ERROR;
	}

	p->p_MyArr[p->cur_Size++] = data;
	return OK;
}

int delData(p_MyList& p, int position)
{
    
	if (p->cur_Size <= 0)
	{
    
		cout << "List is Empty!" << endl;
		return ERROR;
	}

	if (p->cur_Size == (position - 1))
		p->cur_Size--;
	else
	{
    
		for (int i = (position - 1); i < p->cur_Size; i++)
		{
    
			p->p_MyArr[i] = p->p_MyArr[i + 1];
		}
	}
	p->cur_Size--;
	return OK;
}

void show(p_MyList& p)
{
    
	for (int i = 0; i < p->cur_Size; i++)
		cout << p->p_MyArr[i] << ' ';
}

int Empty(p_MyList& p)
{
    
	if (p->Capacity == NULL)
		return ERROR;
	return p->Capacity == 0;
}

int getSize(p_MyList& p)
{
    
	return p->cur_Size;
}

int lookup(p_MyList& p, int data)
{
    
	if (p->cur_Size <= 0)
	{
    
		cout << "List is Empty!" << endl;
		return ERROR;
	}

	for (int i = 0; i < p->cur_Size; i++)
	{
    
		if (p->p_MyArr[i] == data)
		{
    
			cout << endl;
			cout << "Query to number " << data << endl;
			return OK;
		}
	}
	cout << endl;
	cout << "no seek to number" << endl;
	return OK;
}

int modify(p_MyList& p, int position, int data)
{
    
	if (p->cur_Size <= 0)
	{
    
		cout << "List is Empty!";
		return ERROR;
	}

	for (int i = 0; i < p->cur_Size; i++)
	{
    
		if (i == position - 1)
		{
    
			p->p_MyArr[i] = data;
		}
	}
	return OK;
}

main.cpp Call in ：

#include<iostream>
#include"class.hpp"
#include"function.h"

using namespace std;

void test01()
{
    
	p_MyList p = createList(10);
	for (int i = 0; i < 10; i++)
	{
    
		AddLData(p, i);
	}
	show(p);
	delData(p,10);
	cout << endl;
	show(p);
	lookup(p, 8);
	modify(p, 2, 9);
	show(p);
}

int main(int argv, char* argc)
{
    
	test01();

	char ch=getchar();
	return 0;
}

Finally, a running screenshot is attached ：

The first line inserts the element ;
The second line deletes the element ;
The third line queries whether there is the element ;
The fourth line modifies the element ;