数据结构与算法（一）线性表c语言实现（带源码）

数据结构与算法（一）线性表

#系列开篇
自学数据结构小白一名，根据能力持续更新，单纯学习分享贴。本系列适合刚入门的小白参考，大佬轻喷。开始学习时看了很多的书都没有完整的代码，由于太菜连伪代码也无法实现，如果有和我类似的朋友们可以来看看。话少，必要时有描述，一般直接上代码。

1. 线性表的顺序实现

#include <stdio.h>
#include <stdlib.h>
#include <malloc.h>
typedef struct Arr
{
	int* pBase;
	int len;//数组长度
	int cnt;//有效元素
}Arr;

void init_arr(Arr*, int);
bool append_arr(Arr*,int);
bool insert_arr(Arr*, int,int);
bool delete_arr(Arr*, int, int*);
bool is_empty(Arr*);
bool is_full(Arr* pArr);
void sort_arr(Arr*);
void show_arr(Arr*);
void inversion_arr(Arr*);

int main()
{
	int val;
	struct Arr arr;
	init_arr(&arr, 6);
	append_arr(&arr, 1);
	append_arr(&arr, 2);
	append_arr(&arr, 3);
	//printf("%d",(&arr)->len);
	//insert_arr(&arr, 4, 10);
	//show_arr(&arr);
	//delete_arr(&arr, 1, &val);
	//show_arr(&arr);
	//printf("被删除的元素是%d\t",val);
	//inversion_arr(&arr);
	//sort_arr(&arr);
	show_arr(&arr);
	free((&arr)->pBase);
	return 0;
}

void init_arr(Arr* pArr, int length)
{
	pArr->pBase = (int*)malloc(sizeof(int) * length);
	if (NULL == pArr->pBase)
	{
		printf("动态内存分配失败\n");
		exit(-1);
	}
	else
	{
		pArr->len = length;
		pArr->cnt = 0;
	}
	return;
}

bool is_empty(Arr* pArr)
{
	if (pArr->cnt == NULL)
		return true;
	else
		return false;
}

bool is_full(Arr* pArr)
{
	if (pArr->cnt == pArr->len)
		return true;
	else
		return false;
}


void show_arr(Arr* pArr)
{
	if (is_empty(pArr))
	{
		printf("数组为空\n");
	}
	else
	{
		for (int i = 0; i < pArr->cnt; ++i)
		{
			printf("%d\n", pArr->pBase[i]);
		}
	}
}

bool append_arr(Arr* pArr, int val)
{
	if (is_full(pArr))
		return false;
	else
	{
		pArr->pBase[pArr->cnt] = val;
		(pArr->cnt++);
		return true;
	}
		
}

bool insert_arr(Arr* pArr, int pos, int val)
{
	int i;
	if (pos < 1 || pos>pArr->cnt+1)//最后一个元素可以被修改
		return false;
	if (is_full(pArr))
		return false;
	for (i = pArr->cnt - 1; i >= pos - 1; --i)
	{
		pArr->pBase[i + 1] = pArr->pBase[i];
	}
	pArr->pBase[pos - 1] = val;
	pArr->cnt++;
	return true;
}


bool delete_arr(Arr* pArr, int pos, int* pVal)
{
	int i;
	if (is_empty(pArr))
		return false;
	if (pos<1 || pos>pArr->cnt)
		return false;     //上面两个操作可以将指针移到删除位的前一个
	*pVal = pArr->pBase[pos - 1];
	for (i = pos - 1; i < pArr->cnt; ++i)
	{
		pArr->pBase[i] = pArr->pBase[i + 1];
	}
	pArr->cnt--;
}

void inversion_arr(Arr* pArr)
{
	int i = 0;
	int j = pArr->cnt-1;
	int t;
	while (i < j)
	{
		t = pArr->pBase[i];
		pArr->pBase[i] = pArr->pBase[j];
		pArr->pBase[j] = t;
		i++;
		j--;
	}
	return;
}

void sort_arr(Arr* pArr)
{
	int i, j, t;
	for (i = 0; i < pArr->cnt; ++i)
	{
		for (j = i + 1; j < pArr->cnt; ++j)
		{
			if (pArr->pBase[i] < pArr->pBase[j ])
			{
				t = pArr->pBase[i];
				pArr->pBase[i] = pArr->pBase[j];
				pArr->pBase[j] = t;
			}
		}
	}
}

2.线性表的链式实现

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

typedef struct Node
{
	int data;
	struct Node* pNext;
}NODE,*LinkList;

LinkList create_List();
void traverse_List(LinkList);
bool is_empty(LinkList pHead);
int length_list(LinkList);
bool insert_list(LinkList,int,int);
bool delete_list(LinkList,int,int*);

int main()
{
	LinkList pHead = NULL;
	pHead = create_List();
	int len;
	int val;
	traverse_List(pHead);
	if (is_empty(pHead))
		printf("链表为空\n");
	else
		printf("链表不空\n");
	len = length_list(pHead);
	printf("%d\n",len);
	insert_list(pHead,2, 100);
	traverse_List(pHead);
	delete_list(pHead, 3, &val);
	printf("删除的节点为%d\n",val);
	traverse_List(pHead);
	return 0;
}

LinkList create_List()
{
	int len;
	int i;
	int val;

	LinkList pHead = (LinkList)malloc(sizeof(NODE));
	if (NULL == pHead)
	{
		printf("头结点分配失败\n");
		exit(-1);
	}

	LinkList pTail = pHead;
	pTail->pNext = NULL;

	printf("请输入需要生成的节点个数,len=\t");
	scanf_s("%d",&len);
	for (i = 0; i < len; i++)
	{
		printf("请输入第%d个节点的值:",i+1);
		scanf_s("%d", &val);

		LinkList pNew = (LinkList)malloc(sizeof(NODE));
		if(NULL==pNew)
		{
			printf("节点分配失败\n");
			exit(-1);
		}
		pNew->data = val;
		pTail->pNext = pNew;
		pNew->pNext = NULL;
		pTail = pNew;
	}
	return pHead;
}

void traverse_List(LinkList pHead)
{
	LinkList Lp = pHead->pNext;
	while (Lp != NULL)
	{
		printf("%d\t", Lp->data);
		Lp = Lp->pNext;
	}
}

bool is_empty(LinkList pHead)
{
	if (pHead->pNext == NULL)
		return true;
	else
		return false;
}
int length_list(LinkList pHead)
{
	LinkList p = pHead->pNext;
	int len=0;
	while (p != NULL)
	{
		len++;
		p = p->pNext;
	}
	return len;
}

bool insert_list(LinkList pHead, int pos, int val)
{
	int i = 0;
	LinkList p = pHead;

	while (NULL != p && i < pos - 1)
	{
		p = p->pNext;
		++i;
	}
	if (i > pos - 1 || NULL == p)
		return false;

	LinkList pNew = (LinkList)malloc(sizeof(NODE));
	if (NULL == pNew)
	{
		printf("内存分配失败\n");
		exit(-1);
	}
	pNew->data = val;
	LinkList q = p->pNext;
	p->pNext = pNew;
	pNew->pNext = q;

	return true;
}
bool delete_list(LinkList pHead, int pos, int* val)
{
	int i = 0;
	LinkList p = pHead;

	while (NULL != p->pNext && i < pos - 1)
	{
		p = p->pNext;
		++i;
	}
	if (i > pos - 1 || NULL == p->pNext)
		return false;
	LinkList q = p->pNext;
	*val = q->data;
	p->pNext = p->pNext->pNext;
	free(q);
	q = NULL;
	return true;
}

3. 双向链表

#include <stdio.h>
#include <stdlib.h>
#include <malloc.h>
#include <time.h>

typedef struct Node
{
	int data;
	struct Node* next;
	struct Node* prior;
}NODE, * DuLinkList;

DuLinkList create_List(int);
void traverse_List(DuLinkList);
bool insert_list(DuLinkList, int, int);
bool delete_list(DuLinkList, int, int*);

int main()
{
	int val;
	DuLinkList pHead = create_List(5);
	traverse_List(pHead);
	insert_list(pHead, 2, 1000);
	traverse_List(pHead);
	delete_list(pHead, 2, &val);
	printf("被删除的数字是%d\n",val);
	traverse_List(pHead);
	return 0;
}


DuLinkList create_List(int n)
{
	int i;
	srand(time(0));
	DuLinkList pHead = (DuLinkList)malloc(sizeof(NODE)*n);
	if (pHead == NULL)
	{
		printf("内存分配失败\n");
		exit(-1);
	}
	DuLinkList pTail = pHead;
	pTail->next = NULL;
	pHead->prior = NULL;
	for (i = 0; i < n; i++)
	{
		DuLinkList pNew = (DuLinkList)malloc(sizeof(NODE));
		if (pNew == NULL)
		{
			printf("内存分配失败\n");
			exit(-1);
		}
		pNew->data = rand() % 100 + 1;
		pNew->prior = pTail;
		pNew->next = NULL;
		pTail->next = pNew;
		pTail = pNew;
	}
	return pHead;
}
void traverse_List(DuLinkList pHead)
{
	DuLinkList p = pHead->next;
	while (p != NULL)
	{
		printf("%d\t",p->data);
		p = p->next;
	}
	printf("\n");
	return;
}
bool insert_list(DuLinkList pHead, int pos, int val)
{
	int i=0;
	DuLinkList p = pHead;
	while (p != NULL && i < pos - 1)
	{
		p = p->next;
		++i;
	}
	if (p == NULL || i > pos - 1)
		return false;

	DuLinkList pNew = (DuLinkList)malloc(sizeof(NODE));
	if (pNew == NULL)
	{
		printf("内存分配失败\n");
		exit(-1);
	}

	pNew->data = val;
	pNew->prior = p;
	pNew->next = p->next;
	p->next->prior = pNew;
	p->next = pNew;
	return true;
}
bool delete_list(DuLinkList pHead, int pos, int* pVal)
{
	int i = 0;
	DuLinkList p = pHead;
	while (p != NULL && i < pos - 1)
	{
		p = p->next;
		++i;
	}
	if (p == NULL || i > pos - 1)
		return false;

	DuLinkList q = p->next;
	*pVal = q->data;
	p->next->prior = p;
	p->next = p->next->next;
	free(q);
	q = NULL;
}

如有问题请多多赐教。