C语言之动态顺序表的介绍

来源：爱站网时间：2022-09-13编辑：网友分享

这篇文章主要给大家来说说看C语言之动态顺序表的介绍，动态顺序表在内存中开辟一块空间，可以随我们数据数量的增多来扩容，想要了解详情，请看爱站技术频道小编所整理的资料。

C语言实现动态顺序表的实现代码

顺序表是在计算机内存中以数组的形式保存的线性表，是指用一组地址连续的存储单元依次存储数据元素的线性结构。线性表采用顺序存储的方式存储就称之为顺序表。顺序表是将表中的结点依次存放在计算机内存中一组地址连续的存储单元中。

静态实现：结构体内部只需两个成员，其中一个为固定大小(MAX)的数组，用来存放我们的数据。数组大小我们可以通过在头文件中改变MAX的值来改变。

动态实现：在内存中开辟一块空间，可以随我们数据数量的增多来扩容。

来看看动态的顺序表实现：

1.seqlist.h

#define _CRT_SECURE_NO_WARNINGS 1 
 
#ifndef __SEQLIST_H__ 
#define __SEQLIST_H__ 
#include  
#include  
#include  
#include  
 
typedef int DataType; 
 
#define DEFAULT_SZ 3 
#define INC_SZ 2 
 
typedef struct SeqList 
{ 
 DataType *data; 
 int sz; 
 int capacity; 
}SeqList,*pSeqList; 
 
void InitSeqList(pSeqList pList); 
void PushBack(pSeqList pList,DataType d); 
void PopBack(pSeqList pList); 
void PushFront(pSeqList pList, DataType d); 
void PopFront(pSeqList pList); 
int Find(pSeqList pList, DataType d); 
void Remove(pSeqList pList, DataType d); 
void RemoveAll(pSeqList pList, DataType d); 
void BubbleSort(pSeqList pList); 
int BinarySearch(pSeqList pList, DataType d); 
void PrintfSeqList(pSeqList pList); 
void Insert(pSeqList pList, int pos, DataType d); 
void ReverseList(pSeqList pList); 
void DestroySeqList(pSeqList pList); 
 
 
 
 
#endif//__SEQLIST_H__

2.seqlist.c

#define _CRT_SECURE_NO_WARNINGS 1 
 
#include "seqlist.h" 
 
void InitSeqList(pSeqList pList) 
{ 
 pList->sz = 0; 
 pList->data = (DataType*)malloc(sizeof(DataType)*DEFAULT_SZ); 
 if (pList->data == NULL) 
 { 
  perror("malloc"); 
  return; 
 } 
 memset(pList->data, 0, sizeof(DataType)*DEFAULT_SZ); 
} 
void CheckCapacity(pSeqList pList) 
{ 
 assert(pList); 
 if (pList->sz == pList->capacity) 
 { 
  DataType*ret = (DataType*)realloc(pList->data, sizeof(DataType)*(pList->capacity + INC_SZ)); 
  if (ret == NULL) 
  { 
   perror("realloc"); 
  } 
  pList->data = ret; 
  pList->capacity += INC_SZ; 
 
 } 
} 
void PushBack(pSeqList pList, DataType d) 
{ 
 assert(pList); 
 if (pList->sz == pList->capacity) 
 { 
  CheckCapacity(pList); 
 } 
 pList->data[pList->sz] = d; 
 pList->sz++; 
} 
void PopBack(pSeqList pList) 
{ 
 int i = 0; 
 assert(pList); 
 if (pList->sz == 0) 
 { 
  printf("顺序表为空:sz--; 
} 
void PushFront(pSeqList pList, DataType d) 
{ 
 int i = 0; 
 assert(pList); 
 if (pList->sz == pList->capacity) 
 { 
  CheckCapacity(pList); 
 } 
 for (i = pList->sz; i >= 1; i--) 
 { 
  pList->data[i] = pList->data[i - 1]; 
 } 
 pList->data[0] = d; 
 pList->sz++; 
} 
void PopFront(pSeqList pList) 
{ 
 int i = 0; 
 assert(pList); 
 for (i = 0; i sz; i++) 
 { 
  pList->data[i] = pList->data[i + 1]; 
 } 
 pList->sz--; 
} 
int Find(pSeqList pList, DataType d) 
{ 
 int i = 0; 
 assert(pList); 
 while (i sz) 
 { 
  if (pList->data[i] == d) 
  { 
   return i; 
  } 
  else 
  { 
   i++; 
  } 
 } 
 return -1; 
} 
void Remove(pSeqList pList, DataType d) 
{ 
 int i = 0; 
 int pos = 0; 
 assert(pList); 
 while (pList->data[pos=Find(pList,d)]==d) 
 { 
  for (i = pos; i sz-1; i++) 
  { 
   pList->data[i] = pList->data[i + 1]; 
  } 
  pList->sz--; 
 } 
} 
void RemoveAll(pSeqList pList, DataType d) 
{ 
 int i = 0; 
 int pos = 0; 
 assert(pList); 
 while ((pos = Find(pList, d)) != -1) 
 { 
  for (i = pos; i sz - 1; i++) 
  { 
   pList->data[i] = pList->data[i + 1]; 
  } 
  pList->sz--; 
 } 
} 
void BubbleSort(pSeqList pList) 
{ 
 int i = 0; 
 assert(pList); 
 for (i = 0; i sz - 1; i++) 
 { 
  int j = 0; 
  for (j = 0; j sz - i - 1; j++) 
  { 
   if (pList->data[j]>pList->data[j + 1]) 
   { 
    DataType tmp = pList->data[j]; 
    pList->data[j] = pList->data[j + 1]; 
    pList->data[j + 1] = tmp; 
   } 
  } 
 } 
} 
int BinarySearch(pSeqList pList, DataType d) 
{ 
 int left = 0; 
 int right = pList->sz - 1; 
 assert(pList); 
 while (left > 1); 
  if (d > pList->data[mid]) 
  { 
   left = mid + 1; 
  } 
  else if (d data[mid]) 
  { 
   right = mid - 1; 
  } 
  else 
   return mid; 
 } 
 return -1; 
} 
void PrintfSeqList(pSeqList pList) 
{ 
 int i = 0; 
 for (i = 0; i sz; i++) 
 { 
  printf("%d ", pList->data[i]); 
 } 
} 
void Insert(pSeqList pList, int pos, DataType d) 
{ 
 int i = 0; 
 if (pList->sz == pList->capacity) 
 { 
  CheckCapacity(pList); 
 } 
 for (i = pList->sz - 1; i >= pos; i--) 
 { 
  pList->data[i + 1] = pList->data[i]; 
 } 
 pList->data[pos] = d; 
 pList->sz++; 
} 
void ReverseList(pSeqList pList) 
{ 
 int left = 0; 
 int right = pList->sz - 1; 
 assert(pList); 
 while (left data[left]; 
  pList->data[left] = pList->data[right]; 
  pList->data[right] = tmp; 
  left++; 
  right--; 
 } 
} 
void DestroySeqList(pSeqList pList) 
{ 
 free(pList->data); 
 pList->data = NULL; 
}

3.test.c

#define _CRT_SECURE_NO_WARNINGS 1 
#include "seqlist.h" 
 
//void Test() 
//{ 
// SeqList *List; 
// InitSeqList(&List); 
// PushBack(&List, 1); 
// PushBack(&List, 2); 
// PushBack(&List, 3); 
// PushBack(&List, 4); 
// PushBack(&List, 5); 
// PopBack(&List); 
// printf("%d ", Find(&List, 2)); 
// PrintfSeqList(&List); 
//} 
 
void Test2() 
{ 
 SeqList List; 
 InitSeqList(&List); 
 PushBack(&List, 1); 
 PushBack(&List, 2); 
 PushBack(&List, 3); 
 PushBack(&List, 4); 
 PushBack(&List, 5); 
 PushFront(&List, 5); 
 PushFront(&List, 2); 
 PushFront(&List, 3); 
 //PopFront(&List); 
 RemoveAll(&List, 5); 
 //BubbleSort(&List); 
 //BinarySearch(&List, 3); 
 PrintfSeqList(&List); 
} 
int main() 
{ 
 Test2(); 
 system("pause\n"); 
 return 0; 
}

希望朋友们都看明白了这篇C语言之动态顺序表的介绍文章，如果还有需要小编解答的地方，可以直接来网站留言。获取更多精彩技术文章内容，来爱站技术频道网站翻阅查看吧！

C语言之动态顺序表的介绍

您可能感兴趣的文章

相关阅读

热门软件源码

最新软件源码下载