4--静态链表

来源：互联网发布：结构体中的数组赋值编辑：程序博客网时间：2024/04/28 14:02

一：静态链表的定义

实质：在顺序表的基础上利用数组实现的单链表

作用：有效解决编程语言没有指针的情况下实现链表

为什么data保存的是数据项的指针，因为要避免发生整个数据的拷贝，否则会影响效率

StaticList.h

#ifndef _STATICLIST_H_
#define _STATICLIST_H_

typedef void StaticList;
typedef void StaticListNode;

StaticList* StaticList_Create(int capacity);
void StaticList_Destroy(StaticList* list);
void StaticList_Clear(StaticList* list);
int StaticList_Length(StaticList* list);
int StaticList_Capacity(StaticList* list);
int StaticList_Insert(StaticList* list, StaticListNode* node, int pos);
StaticListNode* StaticList_Get(StaticList* list, int pos);
StaticListNode* StaticList_Delete(StaticList* list, int pos);
#endif

StaticList.c

#include <stdio.h>
#include <malloc.h>
#include "StaticList.h"

#define AVAILABLE -1

//静态链表和
//和单链表相比此处next是下一个元素的数组下标
//而单链表此处是下一个元素的地址
//结点定义
typedef struct _tag_StaticListNode
{
unsigned int data; //保存结点数据项的地址4个字节
int next; //下一个结点的数组下标
} TStaticListNode;

//头结点定义
//柔性数组
//node[0]不使用，NEXT不能=0，此处进行特殊化，XX.next=0即表示已经结束
typedef struct _tag_StaticList
{
int capacity;
int length;
TStaticListNode header; //头结点
TStaticListNode node[];
} TStaticList;
//申请了
//capacity + 1+1:一个用于备用结点，一个弥补node[0]的损失，node[0]不计入capacity中
//node[x]作为备用结点
StaticList* StaticList_Create(int capacity) // O(n)
{
TStaticList* ret = NULL;
int i = 0;

if( capacity >= 0 )
{
ret = (TStaticList*)malloc(sizeof(TStaticList) + sizeof(TStaticListNode) * (capacity + 1));
}

if( ret != NULL )
{
ret->capacity = capacity;
ret->length = 0;
ret->header.next = 0;

for(i=1; i<=capacity; i++)
{
ret->node[i].next = AVAILABLE;
}
}

return ret;
}

void StaticList_Destroy(StaticList* list) // O(1)
{
free(list);
}

void StaticList_Clear(StaticList* list) // O(n)
{
TStaticList* sList = (TStaticList*)list;
int i = 0;

if( sList != NULL )
{
sList->length = 0;
sList->header.next = 0;

for(i=1; i<=sList->capacity; i++)
{
sList->node[i].next = AVAILABLE;
}
}
}

int StaticList_Length(StaticList* list) // O(1)
{
TStaticList* sList = (TStaticList*)list;
int ret = -1;

if( sList != NULL )
{
ret = sList->length;
}

return ret;
}

int StaticList_Capacity(StaticList* list) // O(1)
{
TStaticList* sList = (TStaticList*)list;
int ret = -1;

if( sList != NULL )
{
ret = sList->capacity;
}

return ret;
}

int StaticList_Insert(StaticList* list, StaticListNode* node, int pos) // O(n)
{
TStaticList* sList = (TStaticList*)list;
int ret = (sList != NULL);
int current = 0;
int index = 0;
int i = 0;

ret = ret && ((sList->length) + 1 <= (sList->capacity));
ret = ret && (pos >=0) && (node != NULL);

if( ret )
{
for(i=1; i<=sList->capacity; i++)
{
if( sList->node[i].next == AVAILABLE )
{
index = i;
break;
}
}
//此时，已经找到一个空余结点了，标号Index

sList->node[index].data = (unsigned int)node; //node是传过来的数组元素的地址

sList->node[0] = sList->header;

for(i=0; (i<pos) && (sList->node[current].next != 0); i++)
{
current = sList->node[current].next;
}
//current；得到pos处位置的标号
sList->node[index].next = sList->node[current].next;
sList->node[current].next = index;

sList->length++;
sList->header = sList->node[0] ;
}

return ret;
}

StaticListNode* StaticList_Get(StaticList* list, int pos) // O(n)
{
TStaticList* sList = (TStaticList*)list;
StaticListNode* ret = NULL;
int current = 0;
int object = 0;
int i = 0;

if( (sList != NULL) && (0 <= pos) && (pos < sList->header.data) )
{
sList->node[0] = sList->header;

for(i=0; i<pos; i++)
{
current = sList->node[current].next;
}

object = sList->node[current].next;

ret = (StaticListNode*)(sList->node[object].data);
}

return ret;
}

StaticListNode* StaticList_Delete(StaticList* list, int pos) // O(n)
{
TStaticList* sList = (TStaticList*)list;
StaticListNode* ret = NULL;
int current = 0;
int object = 0;
int i = 0;

if( (sList != NULL) && (0 <= pos) && (pos < sList->header.data) )
{
sList->node[0] = sList->header;

for(i=0; i<pos; i++)
{
current = sList->node[current].next;
}

object = sList->node[current].next;

sList->node[current].next = sList->node[object].next;

sList->node[0].data--;

sList->header = sList->node[0];

sList->node[object].next = AVAILABLE;

ret = (StaticListNode*)(sList->node[object].data);
}

return ret;
}

main.c

#include <stdio.h>
#include <stdlib.h>
#include "StaticList.h"
/* run this program using the console pauser or add your own getch, system("pause") or input loop */

int main(int argc, char *argv[])
{
StaticList* list = StaticList_Create(10);

int index = 0;

char *str1="lalalalala";
char *str2="tatata";
char *str3="uuuu";

// int i = 0;
// int j = 1;
// int k = 2;
// int x = 3;
// int y = 4;
// int z = 5;

StaticList_Insert(list, str1, 0);
StaticList_Insert(list, str2, 0);
StaticList_Insert(list, str3, 0);

for(index=0; index<StaticList_Length(list); index++)
{
char* p = (char*)StaticList_Get(list, index);

printf("%s\n", p);
}
//
// printf("\n");
//
// while( StaticList_Length(list) > 0 )
// {
// int* p = (int*)StaticList_Delete(list, 0);
//
// printf("%d\n", *p);
// }
//
// printf("\n");
//
// StaticList_Insert(list, &x, 0);
// StaticList_Insert(list, &y, 0);
// StaticList_Insert(list, &z, 0);
//
// printf("Capacity: %d Length: %d\n", StaticList_Capacity(list), StaticList_Length(list));
//
// for(index=0; index<StaticList_Length(list); index++)
// {
// int* p = (int*)StaticList_Get(list, index);
//
// printf("%d\n", *p);
// }
//
StaticList_Destroy(list);

return 0;
}

0 0