線性表線性儲存結構
線性表存數結構分為：順序儲存結構和鏈式儲存結構
順序儲存結構：用一段地址連續的儲存單元依次儲存線性表中的資料元素。
在C語言中可以用一維陣列來實現順序儲存結構。
1、儲存空間的起始位置：陣列node
2、線性表的最大容量：陣列長度 MAXSIZE
3、線性表的當前長度：length
#define MAXSIZE 20
typedef struct _tag_list
{
char node[MAXSIZE];
int length;
} List;
獲取元素操作
1、判斷線性表是否合法
2、判斷位置是否合法
3、直接通過陣列下標的方式獲取元素
char Get(List* list, int pos)
{
char ret = -1;
// 1.判斷線性表是否合法
// 2.判斷位置是否合法
if((list != NULL)&&(0 <= pos)&&(pos < list->length))
{
ret = list->node[pos];
}
return ret;
}
插入元素操作
1、判斷線性表是否合法
2、判斷插入位置是否合法
3、把最後一個元素到插入位置的元素後移一個位置
4、將新元素插入
5、線性表長度加1
int Insert(List* list, char c, int pos)
{
//1.判斷線性表是否合法
int ret = (list != NULL); //這種賦值方式以前沒用過
int i = 0;
//2.判斷插入位置是否合法
ret = ret && (list->length +1 <= MAXSIZE);
ret = ret && (0 <= pos);
if(ret)
{
if(pos >= list->length)
{
pos = list->length;
}
//3.從最後一個元素到第pos個位置
//分別將它們都向後移動一個位置
for(i=list->length; i>pos; i--)
{
list->node[i] = list->node[i-1];
}
//4.將新元素插入
list->node[i] = c;
//5.長度加1
list->length++;
}
return ret;
}
刪除元素操作
1.判斷線性表是否合法
2.判斷刪除位置是否合法
3.將元素取出
4.將刪除位置後的元素分別向前移動一個位置
5.線性表長度減1
char Delete(List* list, int pos)
{
char ret = -1;
int i = 0;
if((list != NULL)&&(0<=pos)&&(pos<list->length))
{
ret = list->node[pos];
for(i = pos+1; i<list->length; i++)
{
list->node[i-1] = list->node[i];
}
list->length--;
}
return ret;
}
下面是一些可以複用的線性表操作函式
1、標頭檔案
#ifndef _SEQLIST_H_
#define _SEQLIST_H_
typedef void SeqList;
typedef void SeqListNode;
SeqList* SeqList_Create(int capacity);
void SeqList_Destroy(SeqList* list);
void SeqList_Clear(SeqList* list);
int SeqList_Length(SeqList* list);
int SeqList_Capacity(SeqList* list);
int SeqList_Insert(SeqList* list, SeqListNode* node, int pos);
SeqListNode* SeqList_Get(SeqList* list, int pos);
SeqListNode* SeqList_Delete(SeqList* list, int pos);
#endif
2、函式實現
#include <stdio.h>
#include <malloc.h>
#include "SeqList.h"
typedef unsigned int TSeqListNode;
typedef struct _tag_SeqList
{
int capacity;//線性表最大容量
int length;//線性表當前位置
TSeqListNode* node;
} TSeqList;
SeqList* SeqList_Create(int capacity) // O(1)
{
TSeqList* ret = NULL;
if( capacity >= 0 )
{
ret = (TSeqList*)malloc(sizeof(TSeqList) + sizeof(TSeqListNode) * capacity);
}
if( ret != NULL )
{
ret->capacity = capacity;
ret->length = 0;
ret->node = (TSeqListNode*)(ret + 1);
}
return ret;
}
void SeqList_Destroy(SeqList* list) // O(1)
{
free(list);
}
void SeqList_Clear(SeqList* list) // O(1)
{
TSeqList* sList = (TSeqList*)list;
if( sList != NULL )
{
sList->length = 0;
}
}
int SeqList_Length(SeqList* list) // O(1)
{
TSeqList* sList = (TSeqList*)list;
int ret = -1;
if( sList != NULL )
{
ret = sList->length;
}
return ret;
}
int SeqList_Capacity(SeqList* list) // O(1)
{
TSeqList* sList = (TSeqList*)list;
int ret = -1;
if( sList != NULL )
{
ret = sList->capacity;
}
return ret;
}
int SeqList_Insert(SeqList* list, SeqListNode* node, int pos) // O(n)
{
TSeqList* sList = (TSeqList*)list;
int ret = (sList != NULL);
int i = 0;
ret = ret && (sList->length + 1 <= sList->capacity);
ret = ret && (0 <= pos);
if( ret )
{
if( pos >= sList->length )
{
pos = sList->length;
}
for(i=sList->length; i>pos; i--)
{
sList->node[i] = sList->node[i-1];
}
sList->node[i] = (TSeqListNode)node;
sList->length++;
}
return ret;
}
SeqListNode* SeqList_Get(SeqList* list, int pos) // O(1)
{
TSeqList* sList = (TSeqList*)list;
SeqListNode* ret = NULL;
if( (sList != NULL) && (0 <= pos) && (pos < sList->length) )
{
ret = (SeqListNode*)(sList->node[pos]);
}
return ret;
}
SeqListNode* SeqList_Delete(SeqList* list, int pos) // O(n)
{
TSeqList* sList = (TSeqList*)list;
SeqListNode* ret = SeqList_Get(list, pos);
int i = 0;
if( ret != NULL )
{
for(i=pos+1; i<sList->length; i++)
{
sList->node[i-1] = sList->node[i];
}
sList->length--;
}
return ret;
}
3、主函式
#include <stdio.h>
#include <stdlib.h>
#include "SeqList.h"
/* run this program using the console pauser or add your own getch, system("pause") or input loop */
int main(int argc, char *argv[])
{
SeqList* list = SeqList_Create(5);
int i = 0;
int j = 1;
int k = 2;
int x = 3;
int y = 4;
int z = 5;
int index = 0;
SeqList_Insert(list, &i, 0);
SeqList_Insert(list, &j, 0);
SeqList_Insert(list, &k, 0);
SeqList_Insert(list, &x, 0);
SeqList_Insert(list, &y, 0);
SeqList_Insert(list, &z, 0);
for(index=0; index<SeqList_Length(list); index++)
{
int* p = (int*)SeqList_Get(list, index);
printf("%d\n", *p);
}
printf("\n");
while( SeqList_Length(list) > 0 )
{
int* p = (int*)SeqList_Delete(list, 0);
printf("%d\n", *p);
}
SeqList_Destroy(list);
return 0;
}