线性表——顺序表

静态顺序表操作

#include<stdio.h>
#define MaxSize 10

//静态顺序表
typedef struct{
	int data[MaxSize];
	int length;
}SqList;

//顺序表初始化 
void InitList(SqList &L){
	for (int i=0;i<MaxSize;i++){
		L.data[i]=0;
	}
	L.length=0;
}

//顺序表插入 
bool ListInsert(SqList &L,int i,int e){
	if (i<1||i>L.length+1){
		return false;
	}
	if (L.length>=MaxSize){
		return false;
	}
	for (int j=L.length;j>=i;j--){
		L.data[j]=L.data[j-1];
	}
	L.data[i-1]=e;
	L.length++;
	return true;
}

//顺序表删除 
bool ListDelete(SqList &L,int i,int &e){
	if (i<1||i>L.length){
		return false;
	}
	e=L.data[i-1];
	for (int j=i-1;j<L.length-1;j++){
		L.data[j]=L.data[j+1];
	}
	L.length--;
	return true;
}

//顺序表查找 
int LocateElem(SqList L,int e){
	for (int i=0;i<L.length;i++){
		if (L.data[i]==e){
			return i+1;
		}
	}
	return 0;
}
 
int main(){
	SqList L;//声明一个顺序表 L 
	InitList(L);//初始化顺序表 L 
	int p[8]={1,2,3,4,5,6,7,8};
	for (int i=1;i<=8;i++){
		if (ListInsert(L,i,p[i-1])){
			printf("List L %dth insert %d.\n",i,p[i-1]);
		}
	}
	int q,e=0;
	printf("Please enter the location you want to delete:");
	scanf("%d",&q);
	if (ListDelete(L,q,e)){
		printf("the %dth number has been deleted,the number is %d.\n",q,e);
	}
	int a;
	printf("Please enter the number you want to find:");
	scanf("%d",&a);
	printf("the number %d has located at %dth.",a,LocateElem(L,a));
	return 0;
}

动态顺序表操作 

#include<stdio.h>
#include<stdlib.h>
#define InitSize 9

//动态顺序表 
typedef struct{
	int *data;
	int MaxSize;
	int length;
}SeqList;

//顺序表初始化 
void InitList(SeqList &L){
	L.data=(int *)malloc(InitSize*sizeof(int));//malloc申请连续存储空间 
	L.length=0;
	L.MaxSize=InitSize;
}

//顺序表扩容/缩容 
void IncreaseList(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);
}

//顺序表插入元素 
bool ListInsert(SeqList &L,int i,int e){
	if (i<1 || i>L.length+1) return false;
	if (L.length>=L.MaxSize) return false;
	for (int j=L.length;j>=i;j--){
		L.data[j]=L.data[j-1];
	}
	L.data[i-1]=e;
	L.length++;
	return true;
}

//顺序表删除元素 
bool ListDelete(SeqList &L,int i,int &e){
	if (i<1||i>L.length){
		return false;
	}
	e=L.data[i-1];
	for (int j=i-1;j<L.length-1;j++){
		L.data[j]=L.data[j+1];
	}
	L.length--;
	return true;
}

//顺序表查找 
int LocateElem(SeqList L,int e){
	for (int i=0;i<L.length;i++){
		if (L.data[i]==e){
			return i+1;
		}
	}
	return 0;
}

//顺序表 
int main(){
	SeqList L;//声明一个顺序表 L 
	InitList(L);//初始化顺序表 L
	int p[8]={1,2,3,4,5,6,7,8};
	for (int i=1;i<=8;i++){
		if (ListInsert(L,i,p[i-1])){
			printf("List L %dth insert %d.\n",i,p[i-1]);
		}
	}
	int q,e=0;
	printf("Please enter the location you want to delete:");
	scanf("%d",&q);
	if (ListDelete(L,q,e)){
		printf("the %dth number has been deleted,the number is %d.\n",q,e);
	}
	int a;
	printf("Please enter the number you want to find:");
	scanf("%d",&a);
	printf("the number %d has located at %dth.",a,LocateElem(L,a));
	return 0;
}