数据结构-线性表（顺式实现 增 删 改 查）

线性表的基本操作

线性表是最常用且最简单得一种数据结构。简言之，一个线性表是n个数据元素得有限序列。

顺序存储实现

#define N 100			//线性表的最大长度	
typedef int data_t
typedef struct{
	data_t data[N];		//表的存储空间
	int last;			//当前表尾指针
}sqlist_t,*sqlink_t;	//顺序表类型

例：

seqlist.h

//seqlist.h
#ifndef __SEQLIST_H__
#define __SEQLIST_H__

#define MAXSIZE 100
typedef int data_t;
typedef struct{
	data_t data[MAXSIZE];
	int last;
}seqlist_t;

seqlist_t *create_seqlist(void);		//创建
void clear_seqlist(seqlist_t *L);		//释放空间

int is_empty_seqlist(seqlist_t *L);		//判断是否为空
int is_full_seqlist(seqlist_t *L);		//判断是否为满
void set_empty_seqlist(seqlist_t *L);	//清空
int get_length_seqlist(seqlist_t *L);	//获取长度
void show_seqlist(seqlist_t *L);		//遍历输出

int insert_seqlist(seqlist_t *L,data_t x,int pos);	//增
int delete_seqlist(seqlist_t *L,int pos);			//删
int change_seqlist(seqlist_t *L,data_t x,int pos);	//改
int search_seqlist(seqlist_t *L,data_t x);			//查

#endif

seqlist.c

//seqlist.c
#include<stdio.h>
#include<stdlib.h>
#include"seqlist.h"
//创建
seqlist_t *create_seqlist(void){
	seqlist_t *L=NULL;
	L = (seqlist_t *)malloc(sizeof(seqlist_t));
	if(L == NULL){
		puts("no memory");
		return NULL;
	}
	L->last = -1;
	return L;
}
//释放空间
void clear_seqlist(seqlist_t *L){
	if(L == NULL){
		puts("seqlist_t *L is NULL");
		return ;
	}
	free(L);
	return ;
}
//判断是否为空
int is_empty_seqlist(seqlist_t *L){
	if(L == NULL){
		puts("seqlist_t *L is NULL");
		return -1;
	}
	return (L->last == -1);
}
//判断是否为满
int is_full_seqlist(seqlist_t *L){
	if(L == NULL){
		puts("seqlist_t *L is NULL");
		return -1;
	}
	return (L->last == MAXSIZE-1);
}
//清空
void set_empty_seqlist(seqlist_t *L){
	if(L == NULL){
		puts("seqlist_t *L is NULL");
		return;
	}
	L->last = -1;
	return ;

}
//获取长度
int get_length_seqlist(seqlist_t *L){
	if(L == NULL){
		puts("seqlist_t *L is NULL");
		return -1;
	}
	return (L->last+1);
}
//遍历输出
void show_seqlist(seqlist_t *L){
	int i=0;
	if(L == NULL){
		puts("seqlist_l *L is NULL");
		return ;
	}
	for(i=0;i<=L->last;i++)
		printf("L->data[%d] = %d\n",i,L->data[i]);
	return ;
}
//增
int insert_seqlist(seqlist_t *L,data_t x,int pos){
	int i = 0;
	if((is_full_seqlist(L))||(pos<0)||(pos>L->last+1)){
		puts("input argv is invalid");
		return -1;
	}
	for(i=L->last;i>=pos;i--)
		L->data[i+1] = L->data[i];
	L->data[pos] = x;
	L->last++;
	return 0;
		
}
//删
int delete_seqlist(seqlist_t *L,int pos){
	int i=0;
	if((pos<0)||(pos>L->last)){
		puts("input pos is invalid");
		return -1;
	}
	for(i=pos;i<get_length_seqlist(L);i++)
		L->data[i] = L->data[i+1];
	L->last--;
	return 0;
}
//改
int change_seqlist(seqlist_t *L,data_t x,int pos){
	if((pos<0)||(pos>L->last)){
		puts("input pos is invalid");
		return -1;
	}
	L->data[pos] = x;
	return 0;
}
//查
int search_seqlist(seqlist_t *L,data_t x){
	int i=0;
	if(L == NULL){
		puts("seqlist_l *L is NULL");
		return -1;
	}
	for(i=0;i<=L->last;i++){
		if(L->data[i] == x)
			return i;
	}
	return -1;
}

test.c

//test.c
#include<stdio.h>
#include<stdlib.h>
#include"seqlist.h"
int main(int argc,const char *argv[]){
	seqlist_t *L=NULL;
	int i=0;
	L=create_seqlist();
	for(i=0;i<=4;i++)
		insert_seqlist(L,i,0);
	printf("seqlist L lenth is %d\n",get_length_seqlist(L));
	show_seqlist(L);
	puts("-----------------------------------------------");
	puts("search data = 3");
	printf("data = 3 pos is %d\n",search_seqlist(L,3));
	printf("seqlist L length is %d\n",get_length_seqlist(L));
	show_seqlist(L);
	puts("-----------------------------------------------");
	puts("delete data = 3");
	delete_seqlist(L,search_seqlist(L,3));
	printf("seqlist L length is %d\n",get_length_seqlist(L));
	show_seqlist(L);
	puts("-----------------------------------------------");
	puts("change data[2] = 99");
	change_seqlist(L,99,2);
	printf("seqlist L length is %d\n",get_length_seqlist(L));
	show_seqlist(L);
	puts("-----------------------------------------------");
	clear_seqlist(L);
	return 0;
}

Makefile

Makefile的书写可参考这篇文章LINUX-Makefile的创建和使用。

//Makefile隐式
cc = gcc
CFLAGS = -O0 -g -Wall
test:test.c seqlist.c
	$(cc) $(CFLAGS) -o $@ $^
.PHONY:clean
clean:
	rm -rf test
//Makefile显式
test:test.o seqlist.o
	gcc test.o seqlist.o -o test
test.o:test.c
	gcc -c test.c -o test.c
seqlist.o:seqlist.c
	gcc -c seqlist.c -o seqlist.o
.PHONY:clean
clean:
	rm -rf test *.o

运行结果截屏