数据结构(1)_线性表的顺序表示

#include<stdio.h>
#include<stdlib.h>

#define initSize 10//最大长度

typedef struct
{
	int* data;
	int maxSize;
	int length;//当前长度
}SeqList;

void initList(SeqList& L)
{
	L.data = (int*)malloc(initSize * sizeof(int));
	L.length = 0;//
	L.maxSize = initSize;
}

//增加动态数组容量
void increaseSize(SeqList& L, int len)
{
	int* p = L.data;
	L.data = (int*)malloc((L.maxSize + len) * sizeof(int));
	for (int i = 0; i < L.length; i++)
	{
		L.data[i] = p[i];
	}
	L.maxSize = L.maxSize + len;
	free(p);
}

//元素插入,注意i是位序(从1开始)
bool listInsert(SeqList& L, int i, int dataIn)
{
	if (i<1 || i>L.length+1)//注意这里imax=length+1
		return false;
	if (L.length >= L.maxSize)//已存满
		return false;
	for (int j = L.length; j >= i; j--)//*
		L.data[i] = L.data[i - 1];
	L.data[i - 1] = dataIn;
	L.length++;

	return true;
}
//元素删除
bool listDelete(SeqList& L, int i, int& dataDel)
{
	if (i<1 || i>L.length)
		return false;
	dataDel = L.data[i - 1];
	for (int j = i; j < L.length; j++)
		L.data[j - 1] = L.data[j];//删除的是表最后一个元素时，这里是会不进for循环，即没有真正删除，但下面length归零,使此元素不会被访问
	L.length--;
	return true;
}

//按值查找,返回值为位序
int locateElem(SeqList L, int data)
{
	for (int i = 0; i < L.length; i++)
	{
		if (L.data[i] == data)
			return i + 1;
	}
	return -1;
}

int main()
{
	SeqList L;
	initList(L);
	listInsert(L, 1, 25);
	//listInsert(L, 2, 23);
	
	int a=0;
	listDelete(L, 1, a);
	printf("Delete: %d\n", a);
	printf("L.length: %d\n", L.length);
	printf("L.data[0]: %d\n", L.data[0]);//此时data[0]为脏数据，因为length=0
	printf("query result : %d\n", locateElem(L, 25));
	return 0;
}