线性表基本操作

顺序表

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

#define MAXSIZE 100

typedef int ElemType;

typedef enum {
	OVERFLOW = -1,ERROR, OK
}Status;

typedef enum {
	FALSE, TRUE
}Bool;

struct list {
	ElemType *base;
	int length;
};

typedef struct list list;
typedef	list *p_list;

//顺序表初始化
Status init(p_list pl) {
	pl->base = (ElemType *)malloc(sizeof(ElemType) * MAXSIZE);
	if (!pl->base) {
		exit(OVERFLOW);
	}
	pl->length = 0;
	return OK;
}

//销毁：内存释放掉
Status destory(p_list pl) {
	if (!pl) {
		return ERROR;
	}
	free(pl->base);//释放掉以后，base仍指向原来内存，有值。所以为其赋值为空
	pl->base = NULL;
	pl->length = 0;
	return OK;
}
//清空：内存在但没数据
Status clear(p_list pl) {
	if (!pl) {
		return ERROR;
	}
	pl->length = 0;
	return OK;
}
//求表长度
int length(p_list pl) {
	assert(pl);//判断表达式是否为真：假时结束程序/
	return pl->length;
}
//判断表是否为空
Bool isEmpty(p_list pl) {
	assert(pl);
	return pl->length == 0 ? TRUE : FALSE;
}

//获取表中某个数据元素的内容
Status getData(p_list pl, int index, ElemType* pe) {
	assert(pl);
	if (index < 1 || index >= pl->length) {
		return ERROR;
	}
	*pe = pl->base[index - 1];
	//*pe = *(pl->base + index - 1);
	return OK;
}

//查找：根据指定数据获取数据所在位置
int locate(p_list pl, ElemType e) {
	int i;
	assert(pl);
	for (i = 0; i < pl->length; i++) {
		if (*(pl->base + i) == e) {
			return i + 1;
		}
	}
	return -1;
}
//插入：在第i个节点之前插入数据
//插在第i个节点之前，移动n-i+1次
Status insert(p_list pl, int index, ElemType e) {
	int i;

	//原表不够的话进行扩充
	ElemType* newbase;
	if (pl->length + 1 > MAXSIZE) {
		newbase = (ElemType *)malloc(sizeof(ElemType) * 2 * MAXSIZE);
		for (i = 0; i < pl->length; i++) {
			newbase[i] = pl->base[i];
		}
		free(pl->base);
		pl->base = newbase;
	}
	if (index < 1 || index >= pl->length){
		return ERROR;
	}

	for (i = pl->length; i > index; i--) {
		pl->base[i] = pl->base[i - 1];
	}

	pl->base[i] = e;//i==index
	pl->length++;
	return OK;	
}
//删除第i个节点		移动n-i次
Status listDelete(p_list pl,int index,ElemType *pe) {
	if (index<1 || index>pl->length) {
		return ERROR;
	}

	*pe = pl->base[index - 1];
	for (int i = index - 1; i < pl->length; i++) {
		pl->base[i] = pl->base[i + 1];
	}
	pl->length--;
	return OK;
}

int main()
{

	return 0;
}

链表

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

typedef int ElemType;

typedef enum {
	OVERFLOW = -1,ERROR , OK
}Status;

typedef enum {
	FALSE,TRUE
}Bool;

struct Node {
	ElemType data;
	struct Node *next;
};

typedef struct Node Node;
typedef Node		*p_Node;
typedef Node		List;
typedef Node		*p_list;

//struct Node {
//	ElemType data;
//	struct Node *next;
//};
//struct list {
//	struct Node *head;
//	int			length;
//};
//typedef struct Node Node;
//typedef Node		*p_Node;
//typedef struct List list;
//typedef List *p_List;

//初始化
Status init(p_list *ppl) {
	*ppl = (p_list)malloc(sizeof(Node));
	if (!*ppl) {
		return ERROR;
	}
	(*ppl)->next = NULL;
	return OK;
}
                        
//销毁
Status destory(p_list pl){
	p_Node pn;
	
	while (pl)
	{
		pn = pl;
		pl = pl->next;
		free(pn);
	}
	return OK;
}

//清空
Status clear(p_list pl) {
	p_Node p,q;
	if (!pl) {
		return ERROR;
	}

	p = pl->next;
	while (p)
	{
		q = p;
		p = p->next;
		free(q);
	}
	pl->next = NULL;
	return OK;

}

//求表长
int length(p_list pl) 
{
	p_Node p;
	p = pl->next;
	int i = 0;
	while (p)
	{
		i++;
		p = p->next;
	}
	return i;
}

//判断链表是否为空
Bool isEmpty(p_list pl) {
	if (pl->next != NULL) {
		return FALSE;
	}
	return TRUE;
}

//获取第i个元素的值
Status getElem(p_list pl,int index,ElemType *e) {
	p_Node p;
	p = pl->next;
	int i = 1;

	while (p||i<index)//条件可互换
	{
		p = p->next;
		i++;
	}
	if (i == index) {
		*e = p->data;
	}
	else {
		return ERROR;
	}
	return OK;
}

//根据某值找到元素的地址		????
p_Node findElem(p_list pl, ElemType e) {
	p_Node p;
	p = pl->next;
	while (p&&p->data!=e)//条件不可互换	因可能出现NULL->data!=e
	{
		p = p->next;
	}
	return p;
}
//插入：在第i个元素之前插入节点
Status insert(p_list pl, int index, ElemType e) {
	p_Node p;
	p = pl->next;
	int i = 0;
	while (p&&i<index-1)
	{
		p = p->next;
		i++;
	}
	if (!p || i > index - 1)
	{
		return ERROR;
	}
	p_Node node;
	node->data = e;
	node->next = p->next;
	p->next = node;
	return OK;
}

//删除第i个节点
Status Delete(p_list pl, int index, ElemType *e) {
	p_Node p;
	p = pl->next;
	int i = 0;
	while (p->next&&i < index - 1)
	{
		p = p->next;
		i++;
	}
	if (!(p->next) || i > index - 1) {
		return ERROR;
	}
	p_Node q;
	q = p->next;
	*e = q->data;
	p->next = q->next;
	free(q);
	return OK;
}
//创建链表 头插法
void createHead(p_list pl,int n) {
	p_Node p;
	p->next = NULL;
	for (int i = 0; i < n; i++) {
		p_Node q;
		scanf("%d", &q->data);
		q->next = p->next;
		p->next = q;
	}
}
 
//创建链表 尾插法
void createHead(p_list pl, int n) {
	p_Node p;
	p->next = NULL;
	p_Node r;
	r = p;
	for (int i = 0; i < n; i++) {
		p_Node q;
		scanf("%d", &q->data);
		q->next = NULL;
		r->next = q;
		r = q;
	}
}






int main() {

	p_list* pl;
	init(pl);

	return 0;
}