#ifndef _LINKLIST_H_
#define _LINKLIST_H_
#include <stdio.h>
#include <stdlib.h>
#define TRUE 1
#define FALSE 0
#define OK 0
#define ERROR -1;
typedef int ElemType;
typedef struct SNode
{
ElemType data;
struct SNode *next;
}Node,*Node_Ptr;
typedef struct SList
{
Node* head;
int length;
}LinkList;
ElemType Input();
void Init(LinkList *list);
void Insert(LinkList* list, int pos, ElemType e);
void Delete(LinkList* list, ElemType e);
void PrintElem(ElemType e);
void Print(LinkList list);
void Clear(LinkList* list);
void Destory(LinkList* list);
int IsEmpty(LinkList list);
int GetLength(LinkList list);
void Init(LinkList *list)
{
Node* pHead = (Node*)malloc(sizeof(ElemType));
if(!pHead)
{
printf("error:malloc is NULL\n");
exit(-1);
}
pHead->next = NULL;
list->head = pHead;
list->length = 0;
}
int GetLength(LinkList list)
{
return list.length;
}
int IsEmpty(LinkList list)
{
if(list.length == 0)
{
return TRUE;
}
else
{
return FALSE;
}
}
void PrintElem(ElemType e)
{
printf("%-4d",e);
}
void Print(LinkList list)
{
if( IsEmpty(list) )
{
printf("List is Empty\n");
return;
}
Node* p = list.head;
p = p->next;
while(p != NULL)
{
PrintElem(p->data);
p = p->next;
}
printf("\n");
}
void Insert(LinkList* list, int pos, ElemType e )
{
if(pos < 1)
pos = 1;
else if( pos > list->length)
pos = list->length+1;
Node* p = list->head;
while(--pos)
{
p = p->next;
}
Node* pNew = (Node*)malloc(sizeof(ElemType));
pNew->data = e;
pNew->next = NULL;
if(p != NULL)
{
pNew->next = p->next;
p->next = pNew;
}
else
{
p->next = pNew;
}
list->length++;
return;
}
void Delete(LinkList* list, ElemType e)
{
Node* p = list->head;
Node* q = p->next;
while(q != NULL && q->data !=e )
{
p = p->next;
q = q->next;
}
if(q == NULL)
{
printf("No Found this element \n");
return;
}
p->next = q->next;
free(q);
q = NULL;
list->length--;
}
ElemType Input()
{
printf("input Element:");
ElemType e = 0;
scanf("%d",&e);
getchar();
return e;
}
void Clear(LinkList* list)
{
Node* p = list->head;
Node* q = p->next;
while(q != NULL)
{
p->next = q->next;
free(q);
q=p->next;
list->length--;
}
}
void Destory(LinkList* list)
{
Clear(list);
Node* p = list->head;
free(p);
p = NULL;
printf("List is destoried\n");
}
#endif
- 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
- 10
- 11
- 12
- 13
- 14
- 15
- 16
- 17
- 18
- 19
- 20
- 21
- 22
- 23
- 24
- 25
- 26
- 27
- 28
- 29
- 30
- 31
- 32
- 33
- 34
- 35
- 36
- 37
- 38
- 39
- 40
- 41
- 42
- 43
- 44
- 45
- 46
- 47
- 48
- 49
- 50
- 51
- 52
- 53
- 54
- 55
- 56
- 57
- 58
- 59
- 60
- 61
- 62
- 63
- 64
- 65
- 66
- 67
- 68
- 69
- 70
- 71
- 72
- 73
- 74
- 75
- 76
- 77
- 78
- 79
- 80
- 81
- 82
- 83
- 84
- 85
- 86
- 87
- 88
- 89
- 90
- 91
- 92
- 93
- 94
- 95
- 96
- 97
- 98
- 99
- 100
- 101
- 102
- 103
- 104
- 105
- 106
- 107
- 108
- 109
- 110
- 111
- 112
- 113
- 114
- 115
- 116
- 117
- 118
- 119
- 120
- 121
- 122
- 123
- 124
- 125
- 126
- 127
- 128
- 129
- 130
- 131
- 132
- 133
- 134
- 135
- 136
- 137
- 138
- 139
- 140
- 141
- 142
- 143
- 144
- 145
- 146
- 147
- 148
- 149
- 150
- 151
- 152
- 153
- 154
- 155
- 156
- 157
- 158
- 159
- 160
- 161
- 162
- 163
- 164
- 165
- 166
- 167
- 168
- 169
- 170
- 171
- 172
- 173
- 174
- 175
- 176
#include <stdio.h>
#include <stdlib.h>
#include <stdlib.h>
#include "LinkList.h"
int main(int argc, char *argv[])
{
int i = 0, pos = 0;
ElemType e = 0;
LinkList list;
Init(&list);
for(i=0;i<10;i++)
{
pos = rand()%10;
e = i;
printf("insert e=%d to pos=%d\t",e,pos);
Insert(&list, pos, e);
Print(list);
}
printf("list length %d\n",GetLength(list));
printf("after delete Element's value is 5\n");
Delete(&list, 5);
Print(list);
printf("list length %d\n",GetLength(list));
printf("again delete Element's value is 5\n");
Delete(&list, 5);
printf("list length %d\n",GetLength(list));
Destory(&list);
return 0;
}