linklist 链表的实现

古城微笑少年丶 2024-04-19 07:41 59阅读 0赞

\#include <stdio.h>  
\#include <stdlib.h>  
  
  
typedef struct \_link\_node\_\{  
int data;  
struct \_link\_node\_ \*next;  
\}LinkNode;  
  
  
LinkNode \*creat\_linklist(void);  
LinkNode \*creat\_linknode(int value);  
int insert\_linklist(LinkNode \*head, int value);  
int show\_linklist(LinkNode \*head);  
//int search\_linklist(LinkNode \*head, int value);  
LinkNode \*search\_linklist(LinkNode \*head, int value);  
int modify\_linklist(LinkNode \*head, int obj, int value);  
int delet\_linklist(LinkNode \*head, int obj);  
int free\_linklist(LinkNode \*head);  
  
  
int main()  
\{  
LinkNode \*head = NULL;  
LinkNode \*locate = NULL;  
  
  
head = creat\_linklist();  
  
  
insert\_linklist(head, 100);  
insert\_linklist(head, 200);  
locate = search\_linklist(head, 1000);  
if(locate)  
printf("locate: %d\\n", locate->data);  
modify\_linklist(head, 1000, 1000);  
show\_linklist(head);  
delet\_linklist(head, 200);  
show\_linklist(head);  
free\_linklist(head);  
return 0;  
\}  
  
  
LinkNode \*creat\_linknode(int value)  
\{  
LinkNode \*node = NULL;  
  
  
node = (LinkNode \*)malloc(sizeof(LinkNode));  
node->data = value;  
node->next = NULL;  
  
  
return node;  
\}  
  
  
LinkNode \*creat\_linklist(void)  
\{  
return creat\_linknode(0);  
\}  
  
  
int insert\_linklist(LinkNode \*head, int value)  
\{  
LinkNode \*node = NULL;  
  
  
node = creat\_linknode(value);  
node->next = head->next;  
head->next = node;  
  
  
return 0;  
\}  
  
  
int show\_linklist(LinkNode \*head)  
\{  
LinkNode \*p = head->next;  
  
  
while(NULL != p)  
\{  
printf("%3d ", p->data);  
p = p->next;  
\}  
putchar('\\n');  
return 0;  
\}  
  
  
\#if 0  
int search\_linklist(LinkNode \*head, int value)  
\{  
int nu = 1;  
LinkNode \*p = head->next;  
  
  
while(NULL != p)  
\{  
if(p->data == value)  
return nu;  
nu ++;  
p = p->next;  
\}  
return -1;  
\}  
\#else  
  
  
LinkNode \*search\_linklist(LinkNode \*head, int value)  
\{  
LinkNode \*p = head->next;  
  
  
while(NULL != p)  
\{  
if(p->data == value)  
return p;  
p = p->next;  
\}  
return NULL;  
\}  
\#endif  
  
  
int modify\_linklist(LinkNode \*head, int obj, int value)  
\{  
LinkNode \*locate = NULL;  
  
  
locate = search\_linklist(head, obj);  
if(NULL == locate)  
return -1;  
locate->data = value;  
  
  
return 0;  
\}  
  
  
int delet\_linklist(LinkNode \*head, int obj)  
\{  
LinkNode \*p = head;  
LinkNode \*tmp = NULL;  
  
  
while(NULL != p->next && p->next->data != obj)  
p = p->next;  
  
  
if(NULL == p->next)  
return -1;  
tmp = p->next;  
p->next = tmp->next;  
free(tmp);  
return 0;  
\}  
  
  
int free\_linklist(LinkNode \*head)  
\{  
LinkNode \*tmp = NULL,  
\*p = head;  
  
  
while(NULL != p)  
\{  
tmp = p;  
p = p->next;  
free(tmp);  
\}  
return 0;  
\}