数据结构顺序表

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

以下是顺序表的简要操作：

#ifndef __SEQLIST_H__#define __SEQLIST_H__#define FALSE  -1#define TRUE    0#define INIT_SIZE     100#define INCRESS_SIZE  20  typedef int SeqData;// 顺序表结构typedef struct _seqList{SeqData *list;  // 指向存储空间的指针int max_len;       // 保存存储空间最大长度int len;           // 保存当前使用的长度}SeqList;// 创建顺序表SeqList *Create_List();// 销毁顺序表void Destroy(SeqList *s);// 插入数据：尾插法int Insert_Last(SeqList *s, SeqData data);// 插入数据：头插法int Insert_Head(SeqList *s, SeqData data);// 插入数据：在下标为 pos 的位置插入数据int Insert_Pos(SeqList *s, int pos, SeqData data);int GetData(SeqList *s, int pos, SeqData *x);// 查找元素，如果找到，将该元素的下标给xint FindData(SeqList *s, SeqData data, SeqData *x);// 删除 pos 下标的元素int Delete_Pos(SeqList *s, int pos);// 删除指定数据int Delete_Data(SeqList *s, SeqData data);// 逆序int Reverse_List(SeqList *s);// 将两个顺序表合并成一张顺序表// 前提：两张表都是排好序表// 合并后的表要求是从小到大排列的，函数返回新表的指针SeqList * Merge_List(SeqList *s1, SeqList *s2);void Display(SeqList *s);#endif // __SEQLIST_H__

#define __SEQLIST_H__#define FALSE  -1#define TRUE    0#define INIT_SIZE     100#define INCRESS_SIZE  20  typedef int SeqData;// 顺序表结构typedef struct _seqList{SeqData *list;  // 指向存储空间的指针int max_len;       // 保存存储空间最大长度int len;           // 保存当前使用的长度}SeqList;// 创建顺序表SeqList *Create_List();// 销毁顺序表void Destroy(SeqList *s);// 插入数据：尾插法int Insert_Last(SeqList *s, SeqData data);// 插入数据：头插法int Insert_Head(SeqList *s, SeqData data);// 插入数据：在下标为 pos 的位置插入数据int Insert_Pos(SeqList *s, int pos, SeqData data);int GetData(SeqList *s, int pos, SeqData *x);// 查找元素，如果找到，将该元素的下标给xint FindData(SeqList *s, SeqData data, SeqData *x);// 删除 pos 下标的元素int Delete_Pos(SeqList *s, int pos);// 删除指定数据int Delete_Data(SeqList *s, SeqData data);// 逆序int Reverse_List(SeqList *s);// 将两个顺序表合并成一张顺序表// 前提：两张表都是排好序表// 合并后的表要求是从小到大排列的，函数返回新表的指针SeqList * Merge_List(SeqList *s1, SeqList *s2);void Display(SeqList *s);#endif // __SEQLIST_H__

#include "SeqList.h"#include <stdlib.h>#include <stdio.h>SeqList *Create_List(){// 创建一个顺序表SeqList* s = (SeqList*)malloc(sizeof(SeqList)/sizeof(char));if (s == NULL){return NULL;}// 初始化顺序的成员// 为顺序表分配存储空间s->list = (SeqData *)malloc(sizeof(SeqData)/sizeof(char)*INIT_SIZE);if (s->list == NULL){free(s);  // 创建存储空间失败，先释放顺序表结点return NULL;}s->max_len = INIT_SIZE;s->len = 0;return s;}void Destroy(SeqList *s){if (s == NULL)return;// 先释放存储空间free (s->list);// 释放顺序表free (s);}int AgainMalloc(SeqList *s){if (s == NULL)return FALSE;// 新申请空间的字节数int new_size = sizeof(SeqData)/sizeof(char)*(INIT_SIZE + INCRESS_SIZE);SeqData* tmp = (SeqData*)realloc(s->list, new_size);if (tmp == NULL){return FALSE;}s->list = tmp;s->max_len += INCRESS_SIZE;return TRUE;}int Insert_Last(SeqList *s, SeqData data){if (s == NULL){return FALSE;}// 检测顺序表是否存满if (s->len == s->max_len){// 扩展空间if (AgainMalloc(s) != TRUE){return FALSE;}}// 插入数据s->list[s->len] = data;s->len++;return TRUE;}int Insert_Head(SeqList *s, SeqData data){if (s == NULL)return FALSE;// 检测顺序表是否存满if (s->len == s->max_len){if (AgainMalloc(s) != TRUE){return FALSE;}}// 进行移位int i;for (i = s->len-1; i >= 0; i--){s->list[i+1] = s->list[i];}s->list[0] = data;s->len++;return TRUE;}int Insert_Pos(SeqList *s, int pos, SeqData data){if (s == NULL || pos < 0 || pos > s->len)return FALSE;// 检测顺序表是否存满if (s->len == s->max_len){if (AgainMalloc(s) != TRUE){return FALSE;}}// 进行移位int i;for (i = s->len-1; i >= pos; i--){s->list[i+1] = s->list[i];}s->list[pos] = data;s->len++;return TRUE;}int GetData(SeqList *s, int pos, SeqData *x){if (s == NULL || pos < 0 || pos >= s->len || x == NULL)return FALSE;*x = s->list[pos];return TRUE;}int FindData(SeqList *s, SeqData data, SeqData *x){if (s == NULL || x == NULL)return FALSE;int i;int flag = 0;for (i = 0; i < s->len; i++){if (s->list[i] == data){*x = i;flag = 1;break;}}if (flag == 0)return FALSE;return TRUE;}int Delete_Pos(SeqList *s, int pos){if (s == NULL || pos < 0 || pos >= s->len){return FALSE;}// 移动元素int i;for (i = pos; i < s->len-1; i++){s->list[i] = s->list[i+1];}s->len--;return TRUE;}int Delete_Data(SeqList *s, SeqData data){if (s == NULL)return FALSE;int index = -1;if (FindData(s, data, &index) == FALSE)return FALSE;return Delete_Pos(s, index);}int Reverse_List(SeqList *s){if (s == NULL)return FALSE;int min = 0;int max = s->len - 1;SeqData tmp;while (min < max){tmp = s->list[min];s->list[min++] = s->list[max];s->list[max--] = tmp;}return TRUE;}SeqList * Merge_List(SeqList *s1, SeqList *s2){if (s1 == NULL || s2 == NULL)return NULL;SeqList* s3 = (SeqList*)malloc(sizeof(SeqList)/sizeof(char));if (s3 == NULL)return NULL;// 为s3分配存储空间int size = sizeof(SeqData)/sizeof(char)*(s1->len + s2->len);s3->list = (SeqData*)malloc(size);s3->len  = s1->len + s2->len;s3->max_len = s3->len;int i = 0;     // 遍历 s1int j = 0;     // 遍历 s2int k = 0;     // 遍历 s3while (i < s1->len && j < s2->len){if (s1->list[i] < s2->list[j]){s3->list[k++] = s1->list[i++];}else{s3->list[k++] = s2->list[j++];}}while (i < s1->len){s3->list[k++] = s1->list[i++];}while (j < s2->len){s3->list[k++] = s2->list[j++];}return s3;}void Display(SeqList *s){if (s == NULL)return;int i;int count = 0;for (i = 0; i < s->len; i++){if (i % 4 == 0)printf ("\n");printf ("%8d", s->list[i]);}printf ("\n");}

#include <stdio.h>#include "SeqList.h"int main1(){// 创建顺序表SeqList *s = Create_List();if (s == NULL){printf ("创建失败\n");return -1;}printf ("创建成功\n");// 插入数据int i;for (i = 0; i < 20; i++){Insert_Last(s, i);}#if 0for (i = 0; i < 20; i++){Insert_Head(s, i);}if (Insert_Pos(s, s->len, 1000) == FALSE){printf ("插入失败");}Display(s);SeqData data;GetData(s, 5, &data);printf ("%d\n", data);int index;if (FindData(s, 100, &index) == FALSE){printf ("没有该元素\n");}elseprintf ("index = %d\n", index);if (Delete_Pos(s, 5) == FALSE){printf ("删除失败\n");}if (Delete_Data(s, 15) == FALSE){printf ("删除失败\n");}#endif//Reverse_List(s);Display(s);Destroy(s);s = NULL;printf ("销毁成功\n");return 0;}int main(){// 创建顺序表SeqList *s1 = Create_List();if (s1 == NULL){printf ("创建失败\n");return -1;}SeqList *s2 = Create_List();if (s2 == NULL){printf ("创建失败\n");return -1;}int i;for (i = 0; i < 20; i += 2){Insert_Last(s1, i);}for (i = 1; i < 40; i += 2){Insert_Last(s2, i);}SeqList *s3 = Merge_List(s1, s2);printf ("s1: \n");Display(s1);printf ("s2: \n");Display(s2);printf ("s3: \n");Display(s3);return 0;}