29 lines
376 B
C
29 lines
376 B
C
|
#include <stdio.h>
|
|||
|
|
#include <stdlib.h>
|
|||
|
|
#include "linked_list.h"
|
|||
|
|
|
|||
|
|
|
|||
|
|
|
|||
|
|
// <20><>ʼ<EFBFBD><CABC>ֵ
|
|||
|
|
node* init_node(int val)
|
|||
|
|
{
|
|||
|
|
node* new_node = (node*)malloc(sizeof(node));
|
|||
|
|
new_node->value = val;
|
|||
|
|
new_node->next = NULL;
|
|||
|
|
return new_node;
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
|
|||
|
|
// ɾ<><C9BE><EFBFBD><EFBFBD>һ<EFBFBD><D2BB><EFBFBD>ڵ<EFBFBD>
|
|||
|
|
void delete_node(node* n)
|
|||
|
|
{
|
|||
|
|
n->next = n->next->next;
|
|||
|
|
free(n->next);
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
// <20>滻<EFBFBD>ڵ<EFBFBD>ֵ
|
|||
|
|
void replace_node(node* n, int val)
|
|||
|
|
{
|
|||
|
|
|
|||
|
|
}
|