顺序链表的实现

怼烎@ 2024-04-19 06:42 55阅读 0赞

本文运行环境 ubantu 12.04 gcc  
  
\#include <stdio.h>  
\#include <stdlib.h>  
  
  
\#define DEBUG 0  
\#define N 5  
  
  
typedef struct \_sequence\_list\_\{   
int \*data;  
int t\_size;  
int c\_size;  
\}SeqList;  
  
  
SeqList \*creat\_seqlist(int size);  
int free\_seqlist(SeqList \*list);  
int insert\_seqlist(SeqList \*list, int value);  
int search\_seqlist(SeqList \*list, int value);  
int modify\_seqlist(SeqList \*list, int obj, int value);  
int delet\_seqlist(SeqList \*list, int value);  
int show\_seqlist(SeqList \*list);  
void \_debug\_(SeqList \*list);  
  
  
int main()  
\{   
SeqList \*list = NULL;  
int locate;  
int i;  
  
  
list = creat\_seqlist(N);  
for(i = 10 ; i < 20; i ++)  
insert\_seqlist(list, i);  
\#if DEBUG  
\_debug\_(list);  
\#endif  
locate = search\_seqlist(list, 10);  
printf("locate: %d\\n", locate);  
modify\_seqlist(list, 12, 20);  
\#if DEBUG  
\_debug\_(list);  
\#endif  
delet\_seqlist(list, 20);  
show\_seqlist(list);  
\#if DEBUG  
\_debug\_(list);  
\#endif  
free\_seqlist(list);  
return 0;  
\}  
  
  
SeqList \*creat\_seqlist(int size)  
\{   
SeqList \*list = NULL;  
  
  
list = (SeqList \*)malloc(sizeof(SeqList));  
list->data = (int \*)malloc(sizeof(int) \* size);  
// memset(list->data, 0, sizeof(int) \* size);  
list->t\_size = size;  
list->c\_size = 0;  
  
  
return list;  
\}  
  
  
int insert\_seqlist(SeqList \*list, int value)  
\{   
int i;  
  
  
if(NULL == list)  
return -1;  
if(list->c\_size >= list->t\_size)  
return -1;  
  
for(i = list->c\_size; i > 0; i --)  
list->data\[i\] = list->data\[i - 1\];  
list->data\[0\] = value;  
// \*list->data = value;  
list->c\_size ++;  
return 0;  
\}  
  
  
void \_debug\_(SeqList \*list)  
\{   
int i;  
  
for(i = 0; i < 10; i ++)  
printf("%3d ", list->data\[i\]);  
putchar(10);  
\}  
  
  
int free\_seqlist(SeqList \*list)  
\{   
if(NULL == list)  
return -1;  
  
  
free(list->data);  
free(list);  
return 0;  
\}  
  
  
int search\_seqlist(SeqList \*list, int value)  
\{   
int i;  
  
  
for(i = 0; i < list->c\_size; i ++)  
\{   
if(list->data\[i\] == value)  
return i;  
\}  
return -1;  
\}  
  
  
int modify\_seqlist(SeqList \*list, int obj, int value)  
\{   
int locate;  
  
  
locate = search\_seqlist(list, obj);  
if(locate < 0)  
return -1;  
list->data\[locate\] = value;  
return 0;  
\}  
  
  
int delet\_seqlist(SeqList \*list, int value)  
\{   
int locate;  
int i;  
  
if(list->c\_size <= 0)  
return -1;  
  
  
locate = search\_seqlist(list, value);  
if(locate < 0)  
return -1;  
  
for(i = locate; i < list->c\_size - 1; i ++)  
list->data\[i\] = list->data\[i + 1\];  
list->c\_size --;  
  
  
return 0;  
\}  
  
  
int show\_seqlist(SeqList \*list)  
\{   
int i ;  
  
  
for(i = 0; i < list->c\_size; i ++)  
printf("%3d ", list->data\[i\]);  
putchar(10);  
  
  
return 0;  
\}