2.1 线性表——数据结构严蔚敏

1、类型定义

typedef struct node
{
	struct node* next;
	int element;
}S_NODE;

typedef struct
{
	S_NODE* head;
	int size;
}S_LIST;

2、初始化线性表

void InitList(S_LIST* list)
{
	list->head = NULL;
	list->size = 0;
}

3、插入节点

int ListInsert(S_LIST* list, int index, int ele)
{
	S_NODE* p = NULL;
	S_NODE* q = NULL;
	int i = 0;
	
	if(list == NULL)
		return -1;
		
	if(index > list->size || index < 0)
		return -2;
		
	p = (S_NODE*)malloc(sizeof(S_NODE));
	p->next = NULL;
	p->element = ele;
		
	/*在第一个节点插入*/
	if(index == 0)
	{
		list->head = p;
	}
	else
	{
		q = list->head;
		for(i = 0; i < index - 1; i++)
		{
			q = q->next;
		}
		p->next = q->next;
		q->next = p;
	}
	(list->size)++;
	
	return 0;
}

4、销毁链表

void DestoryList(S_LIST* list)
{
	S_NODE* tmp = NULL;
	S_NODE* p = NULL;
	
	if(list == NULL)
		return;
		
	tmp = list->head;
	while(tmp->next != NULL)
	{
		p = tmp->next;
		free(tmp);
		tmp = p;
	}
	free(tmp);
	
	list->head = NULL;
	list->size = 0;
}

5、清空链表

void ClearList(S_LIST* list)
{
	int i;
	S_NODE* p = NULL;	
	
	if(list == NULL)
		return;
		
	p = list->head;
	for(i = 0; i < list->size; i++)
	{
		p->element = 0;
		p = p->next; 
	}
}

6、是否为空

int ListEmpty(S_LIST list)
{
	return list.size == 0;
}

7、链表长度

int ListLength(S_LIST list)
{
	return list.size;
}

8、按索引获取元素

int GetElem(S_LIST list, int index, int* ele)
{
	int i;
	S_NODE* p = NULL;
	
	if(list.head == NULL || ele == NULL || index >= list.size)
		return -1;
	
	p = list.head;	
	for(i = 0; i < index; i++)
	{
		p = p->next;
	}
	
	*ele = p->element;
}

9、按要求判断元素

int compare(int ele, int data)
{
	return ele > data;
}

int LocateElem(S_LIST list, int ele, int (*compare)(int,int))
{
	S_NODE* p = NULL;
	int i;
	
	if(compare == NULL || list.head == NULL)
		return -1;
		
	p = list.head;
	
	for(i = 0; i < list.size; i++)
	{
		if(compare(p->element, ele))
			return i;
		p = p->next;
	}
	
	return -1;
}

10、返回前驱节点元素值

int PriorElem(S_LIST list, int ele, int* pre_e)
{
	S_NODE* p = NULL;
	int i;
	
	if(pre_e == NULL || list.head == NULL)
		return -1;
		
	p = list.head;
	*pre_e = p->element;
	
	for(i = 0; i < list.size; i++)
	{		
		if(p->element == ele)
			return;
		*pre_e = p->element;
		p = p->next;
	}
	
	return 0;
}

11、返回后驱节点元素值

int NextElem(S_LIST list, int ele, int* next_e)
{
	S_NODE* p = NULL;
	int i;
	
	if(next_e == NULL || list.head == NULL)
		return -1;
		
	p = list.head;
	
	for(i = 0; i < list.size; i++)
	{		
		if(p->element == ele)
			break;
		
		p = p->next;
	}
	
	p = p->next;
	*next_e = p->element;
	return 0;
}

12、删除某个元素

int ListDelete(S_LIST* list, int index, int* ele)
{
	S_NODE* p = NULL;
	S_NODE* q = NULL;
	int i;
	
	if(list == NULL || ele == NULL)
		return -1;
		
	p = list->head;
	for(i = 0; i < index - 1; i++)
	{
		p = p->next;
	}
	
	q = p->next;
	*ele = q->element;
	
	p->next = q->next;
	free(q);
	
	(list->size)--;
	
	return 0;
}

13、打印

void PrintList(S_LIST list)
{
	int i;
	S_NODE* p = NULL;	
	
	if(list.head == NULL)
		return;
		
	p = list.head;
	printf("List contains %d: ", list.size);
	for(i = 0; i < list.size; i++)
	{
		printf("%d ", p->element);
		p = p->next; 
	}
	printf("\n");
}

14、测试main

int main()
{
	S_LIST list;
	int i;	
	int ele = 0;
	int index = 0;
	
	printf("1 - Init: ");
	InitList(&list);
	PrintList(list);
	
	printf("\n2 - Insert: ");
	for(i = 0; i < 10; i++)
	{
		ListInsert(&list, i, i); 
	} 	
	PrintList(list);
	
	ListInsert(&list, 5, 100); 
	PrintList(list);
	
	printf("\n3 - GetElem: ");
	GetElem(list, 9, &ele);
	printf("ele = %d", ele);
	
	printf("\n4 - LocateElem: ");
	index = LocateElem(list, 5, compare);
	printf("index = %d", index);
	
	printf("\n5 - PriorElem: ");
	PriorElem(list, 5, &ele);
	printf("ele = %d", ele);
	
	printf("\n6 - NextElem: ");
	NextElem(list, 5, &ele);
	printf("ele = %d", ele);
	
	printf("\n7 - ListDelete: ");
	ListDelete(&list, 5, &ele);
	printf("ele = %d", ele);
	PrintList(list);
	
	printf("\n8 - Clear: ");
	ClearList(&list);
	PrintList(list);
	
	DestoryList(&list);
	
	return 0;
}