单链表

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

int LinkInit(Node **l)
{
	*l = (Node *)malloc(sizeof(Node) * 1);   //分配头结点   l 就是头指针
	if (NULL == *l)
	{
		return FAILURE;
	}

	(*l)->next = NULL;    //头结点指针域为空

	return SUCCESS;
}

int LinkInsert(Node *l, int n, ElemType e)  //n 插入的位置
{
	Node *p = l;
	int k = 1;   //k 移动的次数

	if (NULL == l)
	{
		return FAILURE;
	}

	while (k < n && p != NULL)
	{
		p = p->next;
		k++;
	}

	if (k > n || p == NULL)
	{
		return FAILURE;
	}

	Node *q = (Node *)malloc(sizeof(Node) * 1);
	if (NULL == q)
	{
		return FAILURE;
	}

	q->data = e;   //数据域
	q->next = p->next;
	p->next = q;

	return SUCCESS;
}

int LinkTraverse(Node *l, void (*p)(ElemType))
{
	if (NULL == l)
	{
		return FAILURE;
	}
	Node *q = l;

	while (q->next)
	{
		q = q->next;
		p(q->data);
	}

	return SUCCESS;
}

int LinkLength(Node *l)
{
	if (NULL == l)
	{
		return FAILURE;
	}

	int len = 0;
	Node *p = l->next;

	while (p)
	{
		len++;
		p = p->next;
	}

	return len;
}

int LinkEmpty(Node *l)
{
	return (l->next == NULL) ? TRUE : FALSE;
}

int GetElem(Node *l, int p, ElemType *e)    //p 位置
{
	if (NULL == l || p < 1)   //入参判断  p不能小于0
	{
		return FAILURE;
	}

	Node *q = l;
	int i;

	for (i = 0; i < p && q != NULL; i++)    //循环p次，同时满足q不为空
	{
		q = q->next;
	}

	if (!q)      //如果q为空，说明p（位置）大于长度
	{
		return FAILURE;
	}

	*e = q->data;     //q已经指向第p个结点

	return SUCCESS;
}

int LocateElem(Node *l, ElemType e, int (*p)(ElemType, ElemType))
{
	if (NULL == l)
	{
		return FAILURE;
	}
	
	Node *q = l->next;
	int len = 1;

	while (q)
	{
		if (p(e, q->data) == TRUE)
		{
			return len;
		}
		q = q->next;
		len++;
	}

	return FAILURE;
}

int LinkDelete(Node *l, int p, ElemType *e)
{
	int k = 1;
	Node *q = l;

	if (l == NULL)
	{
		return FAILURE;
	}

	while (k < p && q != NULL)
	{
		q = q->next;
		k++;
	}

	if (k > p || q == NULL)
	{
		return FAILURE;
	}

	Node *n = q->next;
	*e = n->data;
	q->next = n->next;
	free(n);

	return SUCCESS;
}

int LinkClear(Node *l)
{
	if (NULL == l)
	{
		return FAILURE;
	}

	Node *p = l->next;

	while (p)
	{
		l->next = p->next;
		free(p);
		p = l->next;
	}

	return SUCCESS;
}

int LinkDestroy(Node **l)
{
	if (l == NULL)
	{
		return FAILURE;
	}
	free(*l);
	(*l) = NULL;

	return SUCCESS;
}

int LinkReverse(Node *l)
{
	if (NULL == l)
	{
		return FAILURE;
	}

	Node *p = l->next;
	l->next = NULL;

	while (p != NULL)
	{
		Node *q = p;
		p = p->next;
		q->next = l->next;
		l->next = q; 
	}

	return SUCCESS;
}