单链表(带头结点)

1、1. 单链表 （带头结点）:1. 头插/*copyright (C), 2014-2015, Lighting Studio. Co., Ltd. File name：Author：Jerey_Jobs Version:0.1 Date: Description：带表头节点的单链表( 头插 )Funcion List: */#include #include #include struct node /*定义链表节点*/ int num; struct node *next;typedef struct node Node ; /*简化表示链表节点*/typedef struct node *

2、Link;void is_malloc_ok( Link *new_node ) /*为新节点申请内存*/ if( (*new_node) = NULL ) printf( malloc error!n ); exit(-1); void create_link( Link *head ) /*创建带头节点的新的链表*/ ( *head ) = ( Link )malloc( sizeof( Node ) ); is_malloc_ok( head ); ( *head ) - next = NULL;void insert_node_head( Link *head, Link *new_n

3、ode ) /*头插*/ (*new_node) - next = (*head) - next ; (*head) - next = *new_node;void display_link( Link *head ) /*遍历*/ Link tmp; tmp = (*head) - next ; if( tmp = NULL ) printf( link is empty!n ); return ; while( tmp != NULL ) printf( num = %dn, tmp - num ); tmp = tmp - next; void create_new_node( Link

4、 *new_node , int i ) /*创建新的节点*/ (*new_node) = (Link)malloc(sizeof(Node); is_malloc_ok( new_node ); (*new_node) - num = i;void release_link( Link *head ) /*释放*/ Link tmp; tmp = *head; while( *head != NULL ) (*head) = (*head) - next ; free(tmp); tmp = (*head) ; int main() Link head = NULL ; Link new_n

5、ode = NULL ; int i; int num ; create_link( &head ); for( i = 0; i 10; i+ ) create_new_node( &new_node , i); insert_node_head( &head, &new_node ); display_link( &head ); release_link( &head ); return 0;2. 尾插/*copyright (C), 2014-2015, Lighting Studio. Co., Ltd. File name：Author：Jerey_Jobs Version:0.1

6、 Date: Description：带表头节点的单链表( 尾插 )Funcion List: */#include #include #include struct node /*定义链表节点*/ int num; struct node *next;typedef struct node Node ; /*简化表示链表节点*/typedef struct node *Link;void is_malloc_ok( Link *new_node ) /*为新节点申请内存*/ if( (*new_node) = NULL ) printf( malloc error!n ); exit(-1)

7、; void create_link( Link *head ) /*创建带头节点的新的链表*/ ( *head ) = ( Link )malloc( sizeof( Node ) ); is_malloc_ok( head ); ( *head ) - next = NULL;void insert_node_tail( Link *head, Link *new_node ) /*尾插*/ Link tmp; tmp = *head; while( tmp - next != NULL) tmp = tmp - next; tmp - next = (*new_node); (*new_

8、node) - next = NULL;void display_link( Link *head ) /*遍历*/ Link tmp; tmp = (*head) - next ; if( tmp = NULL ) printf( link is empty!n ); return ; while( tmp != NULL ) printf( num = %dn, tmp - num ); tmp = tmp - next; void create_new_node( Link *new_node , int i ) /*创建新的节点*/ (*new_node) = (Link)malloc

9、(sizeof(Node); is_malloc_ok( new_node ); (*new_node) - num = i;void release_link( Link *head ) /*释放*/ Link tmp; tmp = *head; while( *head != NULL ) (*head) = (*head) - next ; free(tmp); tmp = (*head) ; int main() Link head = NULL ; Link new_node = NULL ; int i; int num ; create_link( &head ); for( i

10、 = 0; i 10; i+ ) create_new_node( &new_node , i); insert_node_tail( &head, &new_node ); display_link( &head ); release_link( &head ); return 0;3. 中间插/*copyright (C), 2014-2015, Lighting Studio. Co., Ltd. File name：Author：Jerey_Jobs Version:0.1 Date: Description：带表头节点的单链表( 中间插 )Funcion List: */#inclu

11、de #include #include struct node /*定义链表节点*/ int num; struct node *next;typedef struct node Node ; /*简化表示链表节点*/typedef struct node *Link;void is_malloc_ok( Link *new_node ) /*为新节点申请内存*/ if( (*new_node) = NULL ) printf( malloc error!n ); exit(-1); void create_link( Link *head ) /*创建带头节点的新的链表*/ ( *head

12、 ) = ( Link )malloc( sizeof( Node ) ); is_malloc_ok( head ); ( *head ) - next = NULL;void insert_node_mid( Link *head, Link *new_node ) /*中间插*/ Link p1 = (*head)-next; Link p2 = *head; if(p1 = NULL) (*head)-next = *new_node; (*new_node)-next = NULL; return; while(*new_node)-num p1-num & p1-next != N

13、ULL) p2 = p1; p1 = p1-next; if(p1-next = NULL) if(*new_node)-num p1-num) p1-next = *new_node; (*new_node)-next = NULL; else p2-next = *new_node; (*new_node)-next = p1; else p2-next = *new_node; (*new_node)-next = p1; void display_link( Link *head ) /*遍历*/ Link tmp; tmp = (*head) - next ; if( tmp = N

14、ULL ) printf( link is empty!n ); return ; while( tmp != NULL ) printf( num = %dn, tmp - num ); tmp = tmp - next; void create_new_node( Link *new_node , int i ) /*创建新的节点*/ (*new_node) = (Link)malloc(sizeof(Node); is_malloc_ok( new_node ); (*new_node) - num = i;void release_link( Link *head ) /*释放*/ L

15、ink tmp; tmp = *head; while( *head != NULL ) (*head) = (*head) - next ; free(tmp); tmp = (*head) ; int main() Link head = NULL ; Link new_node = NULL ; int i; int num ; create_link( &head ); for( i = 0; i 10; i+ ) scanf( %d,&num ); create_new_node( &new_node , num); insert_node_mid( &head, &new_node

16、 ); display_link( &head ); release_link( &head ); return 0;4. 删除节点/*copyright (C), 2014-2015, Lighting Studio. Co., Ltd. File name：Author：Jerey_Jobs Version:0.1 Date: Description：带表头节点的单链表( 头插 )(删除)Funcion List: */#include #include #include struct node /*定义链表节点*/ int num; struct node *next;typedef s

17、truct node Node ; /*简化表示链表节点*/typedef struct node *Link;void is_malloc_ok( Link *new_node ) /*为新节点申请内存*/ if( (*new_node) = NULL ) printf( malloc error!n ); exit(-1); void create_link( Link *head ) /*创建带头节点的新的链表*/ ( *head ) = ( Link )malloc( sizeof( Node ) ); is_malloc_ok( head ); ( *head ) - next =

18、NULL;void insert_node_head( Link *head, Link *new_node ) /*头插*/ (*new_node) - next = (*head) - next ; (*head) - next = *new_node;void display_link( Link *head ) /*遍历*/ Link tmp; tmp = (*head) - next ; if( tmp = NULL ) printf( link is empty!n ); return ; while( tmp != NULL ) printf( num = %dn, tmp -

19、num ); tmp = tmp - next; void create_new_node( Link *new_node , int i ) /*创建新的节点*/ (*new_node) = (Link)malloc(sizeof(Node); is_malloc_ok( new_node ); (*new_node) - num = i;void delete_node( Link *head ,int num ) /*删除节点*/ Link tmp1 , tmp2 ; tmp1 = tmp2 = (*head) - next ; if( tmp1 = NULL ) printf( lin

20、k is empty!n ); return ; while( tmp1 - num != num & tmp1 - next != NULL ) tmp2 = tmp1 ; tmp1 = tmp1 - next ; if( tmp1 - next != NULL ) if( tmp1 = (*head) - next ) (*head) - next = tmp1 - next ; free( tmp1 ); else tmp2 - next = tmp1 - next; free( tmp1 ); else if( tmp1 - num = num ) tmp2 - next = NULL

21、 ; free(tmp1); else printf( no such number!n); void release_link( Link *head ) /*释放*/ Link tmp; tmp = *head; while( *head != NULL ) (*head) = (*head) - next ; free(tmp); tmp = (*head) ; int main() Link head = NULL ; Link new_node = NULL ; int i; int num ; scanf( %d, &num ); create_link( &head ); for

22、( i = 0; i 10; i+ ) create_new_node( &new_node , i); insert_node_head( &head, &new_node ); display_link( &head ); printf( n ); delete_node( &head ,num ); display_link( &head ); release_link( &head ); return 0;5. 清空链表/*copyright (C), 2014-2015, Lighting Studio. Co., Ltd. File name：Author：Jerey_Jobs V

23、ersion:0.1 Date: Description：带表头节点的单链表( 头插 )(清空链表)Funcion List: */#include #include #include struct node /*定义链表节点*/ int num; struct node *next;typedef struct node Node ; /*简化表示链表节点*/typedef struct node *Link;void is_malloc_ok( Link *new_node ) /*为新节点申请内存*/ if( (*new_node) = NULL ) printf( malloc err

24、or!n ); exit(-1); void create_link( Link *head ) /*创建带头节点的新的链表*/ ( *head ) = ( Link )malloc( sizeof( Node ) ); is_malloc_ok( head ); ( *head ) - next = NULL;void insert_node_head( Link *head, Link *new_node ) /*头插*/ (*new_node) - next = (*head) - next ; (*head) - next = *new_node;void display_link( Link *head ) /*遍历*/ Link tmp; tmp = (*head) - next ; if( tmp = NULL ) printf( link is empty!n ); return ; while( tmp != NULL