单链表的实现

typedef int elemtype;
typedef struct Node
{
	struct Node* next;
	elemtype data;
}Node,*Pnode;
typedef struct 
{
	struct Node* head;
	elemtype cursize;
}LinkList,*PLinkList;

Node* Buynode()
{
	Node* s = (Node*)malloc(sizeof(elemtype));
	if (s == NULL)exit(1);
	memset(s, 0, sizeof(Node));
	return s;
}
void Init_List(PLinkList plist)
{
	assert(plist != NULL);
	plist->head = Buynode();
	plist->cursize = 0;
}


//for(p=plist;p->next!=NULL;i++);/ /需要前驱,经常用于插入，删除
//for(p=plist->next;p!=NULL;i++)//不需要前驱，经常用于打印,查找


void Insert(PLinkList plist, Pnode pre, int val)
{
	assert(plist != NULL);
	Node* p = (Node*)malloc(sizeof(Node));
	if (p == NULL)exit(1);
	p->data = val;
	p->next = pre->next;
	pre->next = p;
	plist->cursize += 1;
}

bool Insert_pos(PLinkList plist, int pos, int val)
{
	assert(plist != NULL);
	if (pos < 1 || pos>plist->cursize + 1)return 0;
	Node* p = plist->head;
	for (int i = 1; i < pos; i++)
	{
		p = p->next;
	}
	Insert(plist, p, val);
	return true;
}
//头插
void Insert_front(PLinkList plist, int val)
{
	 Insert_pos(plist, 1, val);
}
//尾插
void Insert_tail(PLinkList plist, int val)
{
	Insert_pos(plist, plist->cursize+1,val);
}
//查找search 查找值为val的第一个节点，返回其地址
struct Node* Search(PLinkList plist, int val)
{
	assert(plist!=NULL);
	Node* p = plist->head;
	while (p->next != NULL)
	{
		if (p->next->data == val)
		{
			return p->next;
		}
		p = p->next;
	}
	return NULL;
}

//寻找值为val的节点的前驱
Node* Get_prior(PLinkList plist, int val)
{
	assert(plist != NULL);
	Node* pre = plist->head;
	Node* p = pre->next;
	while (p != NULL)
	{
		if (p->data == val)
		{
			return pre;
		}
		pre = p;
		p = p->next;
	}
	return NULL;
}

//寻找值为val的节点的后继
Node* Get_next(PLinkList plist, int val)
{
	assert(plist != NULL);
	Node* p = Search(plist, val);
	if (p == NULL)exit(1);
	return p->next;
}


//判满 单链表不存在判满操作


//获取其有效值长度
int Get_length(PLinkList plist)
{
	assert(plist != NULL);
	return plist->cursize;
}

void Del_Next(PLinkList plist, Pnode pre)
{
	assert(plist != NULL && pre != NULL);
	Node* p = pre->next;
	pre->next = p->next;
	free(p);
	plist->cursize--;
}
//按值删除 遇到值为val的第一个有效节点 删除掉 释放其内存
bool Del_val(PLinkList plist, int val)
{
	assert(plist != NULL);
	Node* p = Get_prior(plist, val);
	Del_Next(plist, p);
	return true;
}
bool Del_pos(PLinkList plist, int pos)
{
	if (pos<0 || pos>plist->cursize)
	{
		return false;
	}
	//找到此节点的前驱
	Node* p = plist->head;
	for (int i = 0; i < pos; i++)
	{
		p = p->next;
	}
	//删除此节点
	Node* q = p->next;
	p->next = q->next;
	free(q);
	return true;
}

//头删
void pop_back(PLinkList plist)//删除尾部元素
{
	Del_pos(plist, 1);
}
void pop_front(PLinkList plist)//删除头部元素
{
	Del_pos(plist, plist->cursize);
}
//清空
void Clear(PLinkList plist)
{
	assert(plist != NULL);
	for (int i = 0; i < plist->cursize; i++)
	{
		pop_back(plist);
	}
}
void Destory(PLinkList plist)//必须掌握
{
	while (plist->head->next != NULL)//每次判断第一有效节点是否存在
	{
		Node* p = plist->head->next;
		plist->head->next = p->next;
		free(p);
	}
	plist->head->next = NULL;//此时没有有效节点，那么将plist->next置NULL;
}

void Print_list(PLinkList plist)
{
	assert(plist != NULL);
	Node* p = plist->head->next;
	while (p != NULL)
	{
		printf("%d ", p->data);
		p = p->next;
	}
	printf("\n");
}