本节主要有以下内容:
一、线性表
二、顺序表
三、链表
四、顺序表和链表的区别和联系
一、线性表(Linear List)
1.概念:线性表是n个具有相同特性的数据元素的有限序列。
2.分类:顺序表、链表...
3.特点:线性表在逻辑上是线性结构,也就是说是连续的一条直线。但在物理结构上并不一定是连续的,线性表在物理上存储时,通常以数组和链式结构的形式存储。
二、顺序表(Sequence List)
1.概念:顺序表是一段物理地址连续的存储单元依次存储数据元素的线性结构,一般情况下采用数组存储,在数组上完成数据的增删查改。
2.分类:静态顺序表、动态顺序表
//顺序表的静态存储 #define N 1000 typedef int SLDataType; typedef struct SeqList { SLDataType array[N];//定长数组 size_t size;//有效元素个数 }SeqList;
//顺序表的动态存储 typedef int SLDataType; typedef struct SeqList { SLDataType* array;//指向动态开辟的数组 size_t size;//有效元素个数 size_t capacity;//容量大小 }SeqList;
3.动态顺序表实现:
#pragma once
typedef int SLDataType;
typedef struct SeqList
{
SLDataType* _array;//指向动态存储的数组
int _size;//有效元素个数
int _capacity;//容量空间大小
}SeqList;
//1.初始化
void SeqListInit(SeqList* ps, int capacity);
//2.头插
void SeqListPushFront(SeqList* ps, SLDataType data);
//3.尾插
void SeqListPushBack(SeqList* ps, SLDataType data);
//4.指定插入
void SeqListInsert(SeqList* ps, int pos, SLDataType data);
//5.头删
void SeqListPopFront(SeqList* ps);
//6.尾删
void SeqListPopBack(SeqList* ps);
//7.指定删除
void SeqListErase(SeqList* ps, int pos);
//8.查找
int SeqListFind(SeqList* ps, SLDataType data);
//9.修改
void SeqListModify(SeqList* ps, int pos, SLDataType data);
//10.检测有效元素个数
int SeqListSize(SeqList* ps);
//11.检测容量大小
int SeqListCapacity(SeqList* ps);
//12.扩容
void SeqListCheckCapacity(SeqList* ps);
//13.清空
void SeqListClear(SeqList* ps);
//14.销毁
void SeqListDestroy(SeqList* ps);
//15.打印
void SeqListPrint(SeqList* ps);
//16.测试
void SeqListTest();
//17.判空
int SeqListEmpty(SeqList* ps);
#define _CRT_SECURE_NO_WARNINGS
#include "SeqList.h"
#include <stdio.h>
#include <assert.h>
#include <malloc.h>
//1.初始化
void SeqListInit(SeqList* ps, int capacity)
{
ps->_array = (SLDataType*)malloc(sizeof(SLDataType)*capacity);
if (ps->_array == NULL)
{
assert(0);
return;
}
ps->_size = 0;
ps->_capacity = capacity;
}
//2.头插
void SeqListPushFront(SeqList* ps, SLDataType data)
{
assert(ps);
if (ps->_size == ps->_capacity)
{
SeqListCheckCapacity(ps);
}
for (int i = ps->_size-1; i >= 0; --i)
{
ps->_array[i + 1] = ps->_array[i];
}
ps->_array[0] = data;
ps->_size++;
}
//3.尾插
void SeqListPushBack(SeqList* ps, SLDataType data)
{
assert(ps);
if (ps->_size == ps->_capacity)
{
SeqListCheckCapacity(ps);
}
ps->_array[ps->_size] = data;
ps->_size++;
}
//4.指定插入
void SeqListInsert(SeqList* ps, int pos, SLDataType data)
{
assert(ps);
if (pos<0 || pos>ps->_size)
{
printf("输入位置不合法\n");
return;
}
if (ps->_size == ps->_capacity)
{
SeqListCheckCapacity(ps);
}
for (int i = ps->_size - 1; i >= pos-1; --i)
{
ps->_array[i + 1] = ps->_array[i];
}
ps->_array[pos-1] = data;
ps->_size++;
}
//5.头删
void SeqListPopFront(SeqList* ps)
{
assert(ps);
if (SeqListEmpty(ps))
{
return;
}
for (int i = 1; i < ps->_size - 1; ++i)
{
ps->_array[i - 1] = ps->_array[i];
}
ps->_size--;
}
//6.尾删
void SeqListPopBack(SeqList* ps)
{
assert(ps);
if (SeqListEmpty(ps))
{
return;
}
ps->_size--;
}
//7.指定删除
void SeqListErase(SeqList* ps, int pos)
{
assert(ps);
if (pos<0 || pos>ps->_size)
{
printf("输入位置不合法\n");
return;
}
if (SeqListEmpty(ps))
{
return;
}
for (int i = pos; i < ps->_size; ++i)
{
ps->_array[i - 1] = ps->_array[i];
}
ps->_size--;
}
//8.查找
int SeqListFind(SeqList* ps, SLDataType data)
{
assert(ps);
for (int i = 0; i < ps->_size; ++i)
{
if (ps->_array[i] == data)
{
return i + 1;
}
}
return -1;
}
//9.修改
void SeqListModify(SeqList* ps, int pos, SLDataType data)
{
assert(ps);
ps->_array[pos - 1] = data;
}
//10.检测有效元素个数
int SeqListSize(SeqList* ps)
{
assert(ps);
return ps->_size;
}
//11.检测容量大小
int SeqListCapacity(SeqList* ps)
{
assert(ps);
return ps->_capacity;
}
//12.扩容
void SeqListCheckCapacity(SeqList* ps)
{
assert(ps);
if (ps->_size == ps->_capacity){
int NewCapacity = ps->_capacity * 2;
//1.申请新空间
int* ptemp = (SLDataType*)malloc(NewCapacity*sizeof(SLDataType));
if (ptemp == NULL)
{
assert(0);
return;
}
//2.拷贝元素
for (int i = 0; i < ps->_size; ++i)
{
ptemp[i] = ps->_array[i];
}
//3.释放旧空间
free(ps->_array);
//4.更新元素
ps->_array = ptemp;
ps->_capacity = NewCapacity;
}
}
//13.清空
void SeqListClear(SeqList* ps)
{
assert(ps);
ps->_size = 0;
}
//14.销毁
void SeqListDestroy(SeqList* ps)
{
assert(ps);
free(ps->_array);
ps->_array = NULL;
ps->_size = 0;
ps->_capacity = 0;
}
//15.打印
void SeqListPrint(SeqList* ps)
{
assert(ps);
printf("SeqListPrint: ");
for (int i = 0; i < ps->_size; ++i)
{
printf("%d ", ps->_array[i]);
}
putchar('\n');
}
//16.测试
void SeqListTest()
{
SeqList sl;
SeqListInit(&sl,1024);
for (int i = 10; i >0; --i)
{
SeqListPushFront(&sl, i);
}
SeqListPrint(&sl);
//SeqListPushBack(&sl, 11);
//SeqListPrint(&sl);
/*int pos, data;
printf("请输入要插入的位置及数据:");
scanf("%d%d", &pos,&data);
SeqListInsert(&sl, pos, data);
SeqListPrint(&sl);*/
SeqListPopFront(&sl);
SeqListPrint(&sl);
SeqListPopBack(&sl);
SeqListPrint(&sl);
/*int pos;
printf("请输入要删除的位置:");
scanf("%d", &pos);
SeqListErase(&sl, pos);
SeqListPrint(&sl);*/
//printf("您要查找的数据位置为:%d\n", SeqListFind(&sl, 6));
printf("%d\n", SeqListSize(&sl));
printf("%d\n", SeqListCapacity(&sl));
/*SeqListClear(&sl);
SeqListPrint(&sl);*/
/*SeqListModify(&sl, 1, 329);
SeqListPrint(&sl);*/
SeqListDestroy(&sl);
}
//17.判空
int SeqListEmpty(SeqList* ps)
{
assert(ps);
return 0 == ps->_size;
}
#include "SeqList.h"
#include <stdlib.h>
int main()
{
SeqListTest();
system("pause");
return 0;
}
三、链表(linked list)
1.概念:链表是一种物理存储结构上非连续、非顺序的存储结构,数据元素的逻辑顺序是通过链表中的指针链
接次序实现的2.分类
【1】 单向、双向
【2】带头、不带头
【3】循环、非循环3.单链表的实现
#pragma once
typedef int LDataType;
//节点
typedef struct LNode
{
LDataType _data;//数据域
struct LNode* _pNext;//指针域
}LNode,*pNode;
//链表
typedef struct L_List
{
LNode* _pHead;//指向链表中的第一个节点
}L_List;
//1.链表初始化
void L_ListInit(L_List* ps);
//2.链表尾插
void L_ListPushBack(L_List* ps, LDataType data);
//3.链表头插
void L_ListPushFront(L_List* ps, LDataType data);
//4.链表指定位置插入
void L_ListInsert(pNode pos, LDataType data);
//5.链表尾删
void L_ListPopBack(L_List* ps);
//6.链表头删
void L_ListPopFront(L_List* ps);
//7.链表指定位置删除
void L_ListErase(L_List* ps, pNode pos);
//8.寻找元素
pNode L_ListFind(L_List* ps,LDataType data);
//9.获取有效节点个数
int L_ListSize(L_List* ps);
//10.判空
int L_ListEmpty(L_List* ps);
//11.链表销毁
void L_ListDestroy(L_List* ps);
//12.打印链表
void L_ListPrint(L_List* ps);
//13.测试
void L_ListTest();
#include "LinkedList.h"
#include <stdio.h>
#include <assert.h>
#include <malloc.h>
//1.链表初始化
void L_ListInit(L_List* ps)
{
assert(ps);
ps->_pHead = NULL;
}
pNode BuyL_ListNode(LDataType data)
{
pNode pNewNode = (pNode)malloc(sizeof(L_List));
if (pNewNode == NULL){
assert(0);
return NULL;
}
pNewNode->_data = data;
pNewNode->_pNext = NULL;
return pNewNode;
}
//2.链表尾插
void L_ListPushBack(L_List* ps, LDataType data)
{
assert(ps);
pNode pNewNode = BuyL_ListNode(data);
if (ps->_pHead == NULL)
{
//空链表
ps->_pHead = pNewNode;
}
else
{
//链表非空,找链表最后一个节点
pNode pCur = ps->_pHead;
while (pCur->_pNext)
{
pCur = pCur->_pNext;
}
pCur->_pNext = pNewNode;
}
}
//3.链表头插
void L_ListPushFront(L_List* ps, LDataType data)
{
assert(ps);
pNode pNewNode = BuyL_ListNode(data);
pNewNode->_pNext = ps->_pHead;
ps->_pHead = pNewNode;
}
//4.链表指定位置插入
void L_ListInsert(pNode pos, LDataType data)
{
if (pos == NULL){
return;
}
pNode pNewNode = BuyL_ListNode(data);
pNewNode->_pNext = pos->_pNext;
pos->_pNext = pNewNode;
}
//5.链表尾删
void L_ListPopBack(L_List* ps)
{
assert(ps);
//空链表
if (ps->_pHead == NULL)
{
return;
}
//一个节点
else if (ps->_pHead->_pNext == NULL)
{
free(ps->_pHead);
ps->_pHead = NULL;
}
//多个节点
else
{
pNode pPre = NULL;
pNode pCur = ps->_pHead;
while (pCur->_pNext)
{
pPre = pCur;
pCur = pCur->_pNext;
}
free(pCur);
pPre->_pNext = NULL;
}
}
//6.链表头删
void L_ListPopFront(L_List* ps)
{
pNode pDelNode = NULL;
assert(ps);
if (ps->_pHead == NULL)
{
return;
}
pDelNode = ps->_pHead;
ps->_pHead = pDelNode->_pNext;
free(pDelNode);
}
//7.链表指定位置删除
void L_ListErase(L_List* ps, pNode pos)
{
assert(ps);
if (pos == NULL || ps->_pHead == NULL)
{
return;
}
if (pos == ps->_pHead)
{
ps->_pHead = pos->_pNext;
}
else
{
pNode pPrePos = ps->_pHead;
while (pPrePos&&pPrePos->_pNext != pos)
{
pPrePos = pPrePos->_pNext;
}
pPrePos->_pNext = pos->_pNext;
}
free(pos);
}
//8.寻找元素
pNode L_ListFind(L_List* ps, LDataType data)
{
assert(ps);
pNode pCur = ps->_pHead;
while (pCur)
{
if (pCur->_data = data)
{
return pCur;
}
pCur = pCur->_pNext;
}
return NULL;
}
//9.获取有效节点个数
int L_ListSize(L_List* ps)
{
assert(ps);
int size = 0;
pNode pCur = ps->_pHead;
while (pCur)
{
++size;
pCur = pCur->_pNext;
}
return size;
}
//10.判空
int L_ListEmpty(L_List* ps)
{
assert(ps);
return NULL == ps->_pHead;
}
//11.链表销毁
void L_ListDestroy(L_List* ps)
{
assert(ps);
pNode pCur = ps->_pHead;
while (ps->_pHead)
{
pCur = ps->_pHead->_pNext;
free(ps->_pHead);
ps->_pHead = NULL;
ps->_pHead = pCur;
}
}
//12.打印链表
void L_ListPrint(L_List* ps)
{
assert(ps);
pNode pCur = ps->_pHead;
while (pCur)
{
printf("%d--->", pCur->_data);
pCur = pCur->_pNext;
}
}
//13.测试
void L_ListTest()
{
L_List L;
L_ListInit(&L);
L_ListPushBack(&L, 1);
L_ListPushFront(&L, 2);
L_ListPushFront(&L, 3);
L_ListPushFront(&L, 4);
L_ListPrint(&L);
L_ListDestroy(&L);
}
#include "LinkedList.h"
#include <stdlib.h>
int main()
{
L_ListTest();
system("pause");
return 0;
}
四、顺序表和链表的区别和联系
顺序表 | 链表 | |
尾插尾删复杂度 | O(1) | 不带头节点:O(N) |
任意位置插入删除复杂度 | O(N) | O(1) |
空间 | 一段连续的空间 | 底层空间不连续 |
随机访问 | 支持 | 不支持 |
扩容 | 可能需要 | 不需要 |
申请空间 | 只在扩容时需要 | 每次插入元素都需要 |