#define _LINKLIST_H_
typedef void LinkList;
typedef struct _tag_LinkListNode LinkListNode;
struct _tag_LinkListNode
{
LinkListNode* next;
};
LinkList* LinkList_Create();
void LinkList_Destroy(LinkList* list);
void LinkList_Clear(LinkList* list);
int LinkList_Length(LinkList* list);
int LinkList_Insert(LinkList* list, LinkListNode* node, int pos);
LinkListNode* LinkList_Get(LinkList* list, int pos);
LinkListNode* LinkList_Delete(LinkList* list, int pos);
#endif
#include <stdio.h>
#include <malloc.h>
#include "LinkList.h"
typedef struct _tag_LinkList
{
LinkListNode header;
int length;
} TLinkList;
LinkList* LinkList_Create() // O(1)
{
TLinkList* ret = (TLinkList*)malloc(sizeof(TLinkList));
if( ret != NULL )
{
ret->length = 0;
ret->header.next = NULL;
}
return ret;
}
void LinkList_Destroy(LinkList* list) // O(1)
{
free(list);
}
void LinkList_Clear(LinkList* list) // O(1)
{
TLinkList* sList = (TLinkList*)list;
if( sList != NULL )
{
sList->length = 0;
sList->header.next = NULL;
}
}
int LinkList_Length(LinkList* list) // O(1)
{
TLinkList* sList = (TLinkList*)list;
int ret = -1;
if( sList != NULL )
{
ret = sList->length;
}
return ret;
}
int LinkList_Insert(LinkList* list, LinkListNode* node, int pos) // O(n)
{
TLinkList* sList = (TLinkList*)list;
int ret = (sList != NULL) && (pos >= 0) && (node != NULL);
int i = 0;
if( ret )
{
LinkListNode* current = (LinkListNode*)sList;
for(i=0; (i<pos) && (current->next != NULL); i++)
{
current = current->next;
}
node->next = current->next;
current->next = node;
sList->length++;
}
return ret;
}
LinkListNode* LinkList_Get(LinkList* list, int pos) // O(n)
{
TLinkList* sList = (TLinkList*)list;
LinkListNode* ret = NULL;
int i = 0;
if( (sList != NULL) && (0 <= pos) && (pos < sList->length) )
{
LinkListNode* current = (LinkListNode*)sList;
for(i=0; i<pos; i++)
{
current = current->next;
}
ret = current->next;
}
return ret;
}
LinkListNode* LinkList_Delete(LinkList* list, int pos) // O(n)
{
TLinkList* sList = (TLinkList*)list;
LinkListNode* ret = NULL;
int i = 0;
if( (sList != NULL) && (0 <= pos) && (pos < sList->length) )
{
LinkListNode* current = (LinkListNode*)sList;
for(i=0; i<pos; i++)
{
current = current->next;
}
ret = current->next;
current->next = ret->next;
sList->length--;
}
return ret;
}
#ifndef _LINKSTACK_H_
#define _LINKSTACK_H_
typedef void LinkStack;
LinkStack* LinkStack_Create();
void LinkStack_Destroy(LinkStack* Stack);
void LinkStack_Clear(LinkStack* Stack);
int LinkStack_Push(LinkStack* Stack,void* item);
void* LinkStack_Pop(LinkStack* Stack);
void* LinkStack_Top(LinkStack* Stack);
int LinkStack_Size(LinkStack* Stack);
#endif
#include"LinkStack.h"
#include"LinkList.h"
#include<malloc.h>
typedef struct _tag_LinkStackNode
{
LinkListNode header;
void* item;
}TLinkStackNode;
LinkStack* LinkStack_Create()
{
return LinkList_Create();
}
void LinkStack_Destroy(LinkStack* Stack)
{
LinkStack_Clear(Stack);
LinkList_Destroy(Stack);
}
void LinkStack_Clear(LinkStack* Stack)
{
while(LinkStack_Size(Stack)>0)
{
LinkStack_Pop(Stack);
}
}
int LinkStack_Push(LinkStack* Stack,void* item)
{
TLinkStackNode* node = (TLinkStackNode*)malloc(sizeof(TLinkStackNode));
int ret = (node != NULL)&&(item != NULL);
if(ret)
{
node->item = item;
ret = LinkList_Insert(Stack,(LinkListNode*)node,0);
}
if(!ret)
{
free(node);
}
return ret;
}
void* LinkStack_Pop(LinkStack* Stack)
{
TLinkStackNode* node = (TLinkStackNode*)LinkList_Delete(Stack,0);
void* ret = NULL;
if(node != NULL)
{
ret = node->item;
free(node);
}
return ret;
}
void* LinkStack_Top(LinkStack* Stack)
{
TLinkStackNode* node = (TLinkStackNode*)LinkList_Get(Stack,0);
void* ret = NULL;
if(node != NULL)
{
ret = node->item;
}
return ret;
}
int LinkStack_Size(LinkStack* Stack)
{
return LinkList_Length(Stack);
}
#include <stdio.h>
#include <stdlib.h>
#include"LinkStack.h"
/* run this program using the console pauser or add your own getch, system("pause") or input loop */
int main(int argc, char *argv[])
{
LinkStack* Stack = LinkStack_Create();
int a[10];
int i;
for(i = 0;i<10;i++)
{
a[i] = i;
// LinkStack_Push(Stack,a[i]);
}
printf("Top: %d\n",*(int*)LinkStack_Top(Stack));
printf("Length: %d\n",LinkStack_Size(Stack));
while(LinkStack_Size(Stack)>0)
{
printf("Pop: %d\n",*(int*)LinkStack_Pop(Stack));
}
LinkStack_Destroy(Stack);
printf("Press any key to continue \n");
getchar();
return 0;
}