C语言数据结构结构体数组（顺序表）的增删改查软件代码

/*
关于数组顺序表的初始化增删改
*/
#include <stdlib.h>
#include <stdio.h>
#include <iostream>
using namespace std;
#define ERROR 0
#define  OK 1
#define overflow -2
#define MAXSIZE 50
#define ADDSIZE 20
typedef int Elemtype;
typedef int Status;
typedef struct 
{
	Elemtype* elem;
	int length = 0;
	int listsize=0;
}Sqlist;

//初始化
Status InitList(Sqlist& L)
{

	L.elem = (Elemtype*)malloc(sizeof(Elemtype)*MAXSIZE);
	if (!L.elem) return (overflow);
	L.listsize = MAXSIZE;
	
	return OK;
}

//创建顺序表
Status CreateList(Sqlist &L)
{
	if (!L.elem) return ERROR;
	printf("Please Create the SQlist\nplease input the number ");
	printf("末尾以0结束");
	int  i=0;
	system("cls");
	scanf_s("%d", &L.elem[i]);
	system("cls");
	while (L.elem[i] != 0)
	{
		L.length++;
		++i;
		scanf_s("%d", &L.elem[i]);
		system("cls");
	}
	printf("\a the SQlist has been initialized successfully!\n");
	return OK;
}

//插入函数
Status InsertList(Sqlist& L, int i, Elemtype e)
{
	if (i < 1||i>L.length+1) return ERROR;
	if (L.length == MAXSIZE)
	{
		L.elem = (Elemtype*)realloc(L.elem, sizeof(Elemtype) * (ADDSIZE + MAXSIZE));
		if (!L.elem) return (overflow);
		else L.listsize++;
	}
	int j;
	for (j = L.length - 1; j >= i - 1; j--)
	{
		L.elem[j + 1] = L.elem[j];
	}
	L.elem[i - 1] = e;
	L.length++;
	return OK;

}

//删除函数
Status DeleteList(Sqlist& L, int i)
{
	if (i < 1||i>L.length) return ERROR;
	int j;
	for (j = i;j <= L.length - 1; j++)
	{
		L.elem[j - 1] = L.elem[j];
	}
	L.length--;
	return OK;
}

//查找定位函数
Elemtype Locate(Sqlist &L,int i)
{
	if (i > L.length || i < 1) printf("查无此值");
	else return L.elem[i - 1];
}

int main()
{
	printf("welcome to the Sqlist system\n");
	printf("let's create a SQlist now\nplease print 1");
	int para;
	scanf_s("%d",&para);
	int stat;
	if (para == 1)
	{
		Sqlist L;
		stat = InitList(L);
		if (stat == 1)
		{
			system("cls");
			printf("the SQlist has been initialized successfully!\n");
			printf("**********************************************************************************\n");
			
		}
		else exit(0);
		printf("现在开始赋值，以0为结束");
		stat = CreateList(L);
		int* p;
		if (stat == 1)
		{
			printf("创建完毕");
			p = L.elem;
			for (; p < L.elem + L.length; p++)
			{
				printf("%d\t", *p);
			}

		}
		else exit(0);
		
		
		int loc, val;
		char m;
		//人机交互*****************************************
		while (1)
		{
			printf("\n插入请按A，删除值请按B，查找请安C");
			//system("cls");
			cin >> m;
			switch (m)
			{

			case 'A':
				printf("开始插入，请输入插入值和位置");
				scanf_s("%d,%d", &val, &loc);
				stat = InsertList(L, loc, val);
				break;
			case 'B':
				printf("开始删除，请输入删除位置");
				scanf_s("%d", &loc);
				stat = DeleteList(L, loc);
				break;
			case 'C':
				printf("当前数组值如下");
				p = L.elem;
				for (; p < L.elem + L.length; p++)
				{
					printf("%d\t", *p);
				}
				break;
			default:
				exit(0);
			}
		}

	}

}