1、1. 單鏈表 （帶頭結(jié)點）:1. 頭插/*copyright (C), 2014-2015, Lighting Studio. Co., Ltd. File name：Author：Jerey_Jobs Version:0.1 Date: Description：帶表頭節(jié)點的單鏈表( 頭插 )Funcion List: */#include <stdio.h>#include <stdlib.h>#include <malloc.h>struct node /*定義鏈表節(jié)點*/ int num; struct node *next;typedef struc

2、t node Node ; /*簡化表示鏈表節(jié)點*/typedef struct node *Link;void is_malloc_ok( Link *new_node ) /*為新節(jié)點申請內(nèi)存*/ if( (*new_node) = NULL ) printf( "malloc error!n" ); exit(-1); void create_link( Link *head ) /*創(chuàng)建帶頭節(jié)點的新的鏈表*/ ( *head ) = ( Link )malloc( sizeof( Node ) ); is_malloc_ok( head ); ( *head ) -

3、> 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

4、( tmp != NULL ) printf( "num = %dn", tmp -> num ); tmp = tmp -> next; void create_new_node( Link *new_node , int i ) /*創(chuàng)建新的節(jié)點*/ (*new_node) = (Link)malloc(sizeof(Node); is_malloc_ok( new_node ); (*new_node) -> num = i;void release_link( Link *head ) /*釋放*/ Link tmp; tmp = *head; w

5、hile( *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+ ) create_new_node( &new_node , i); insert_node_head( &head, &new_node ); display_link(

6、 &head ); release_link( &head ); return 0;2. 尾插/*copyright (C), 2014-2015, Lighting Studio. Co., Ltd. File name：Author：Jerey_Jobs Version:0.1 Date: Description：帶表頭節(jié)點的單鏈表( 尾插 )Funcion List: */#include <stdio.h>#include <stdlib.h>#include <malloc.h>struct node /*定義鏈表節(jié)點*/ int

7、num; struct node *next;typedef struct node Node ; /*簡化表示鏈表節(jié)點*/typedef struct node *Link;void is_malloc_ok( Link *new_node ) /*為新節(jié)點申請內(nèi)存*/ if( (*new_node) = NULL ) printf( "malloc error!n" ); exit(-1); void create_link( Link *head ) /*創(chuàng)建帶頭節(jié)點的新的鏈表*/ ( *head ) = ( Link )malloc( sizeof( Node )

8、); 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_node) -> next = NULL;void display_link( Link *head ) /*遍歷*/ Link tmp; tmp

9、 = (*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 ) /*創(chuàng)建新的節(jié)點*/ (*new_node) = (Link)malloc(sizeof(Node); is_malloc_ok( new_no

10、de ); (*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 = 0; i < 10; i+ ) c

11、reate_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：帶表頭節(jié)點的單鏈表( 中間插 )Funcion List: */#inc

12、lude <stdio.h>#include <stdlib.h>#include <malloc.h>struct node /*定義鏈表節(jié)點*/ int num; struct node *next;typedef struct node Node ; /*簡化表示鏈表節(jié)點*/typedef struct node *Link;void is_malloc_ok( Link *new_node ) /*為新節(jié)點申請內(nèi)存*/ if( (*new_node) = NULL ) printf( "malloc error!n" ); exi

13、t(-1); void create_link( Link *head ) /*創(chuàng)建帶頭節(jié)點的新的鏈表*/ ( *head ) = ( 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; (*

14、new_node)->next = NULL; return; while(*new_node)->num > p1->num && p1->next != NULL) 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)->nex

15、t = p1; else p2->next = *new_node; (*new_node)->next = p1; 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; vo

16、id create_new_node( Link *new_node , int i ) /*創(chuàng)建新的節(jié)點*/ (*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

17、() 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 ); display_link( &head ); release_link( &head ); return 0;4.

18、刪除節(jié)點/*copyright (C), 2014-2015, Lighting Studio. Co., Ltd. File name：Author：Jerey_Jobs Version:0.1 Date: Description：帶表頭節(jié)點的單鏈表( 頭插 )(刪除)Funcion List: */#include <stdio.h>#include <stdlib.h>#include <malloc.h>struct node /*定義鏈表節(jié)點*/ int num; struct node *next;typedef struct node Node

19、 ; /*簡化表示鏈表節(jié)點*/typedef struct node *Link;void is_malloc_ok( Link *new_node ) /*為新節(jié)點申請內(nèi)存*/ if( (*new_node) = NULL ) printf( "malloc error!n" ); exit(-1); void create_link( Link *head ) /*創(chuàng)建帶頭節(jié)點的新的鏈表*/ ( *head ) = ( Link )malloc( sizeof( Node ) ); is_malloc_ok( head ); ( *head ) -> next =

20、 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 != NU

21、LL ) printf( "num = %dn", tmp -> num ); tmp = tmp -> next; void create_new_node( Link *new_node , int i ) /*創(chuàng)建新的節(jié)點*/ (*new_node) = (Link)malloc(sizeof(Node); is_malloc_ok( new_node ); (*new_node) -> num = i;void delete_node( Link *head ,int num ) /*刪除節(jié)點*/ Link tmp1 , tmp2 ; tmp1 =

22、 tmp2 = (*head) -> next ; if( tmp1 = NULL ) printf( "link 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 ;

23、 free( tmp1 ); else tmp2 -> next = tmp1 -> next; free( tmp1 ); else if( tmp1 -> num = num ) tmp2 -> next = NULL ; free(tmp1); else printf( "no such number!n"); void release_link( Link *head ) /*釋放*/ Link tmp; tmp = *head; while( *head != NULL ) (*head) = (*head) -> next ; fr

24、ee(tmp); tmp = (*head) ; int main() Link head = NULL ; Link new_node = NULL ; int i; int num ; scanf( "%d", &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 ); printf

25、( "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 Version:0.1 Date: Description：帶表頭節(jié)點的單鏈表( 頭插 )(清空鏈表)Funcion List: */#include <stdio.h>#inclu

26、de <stdlib.h>#include <malloc.h>struct node /*定義鏈表節(jié)點*/ int num; struct node *next;typedef struct node Node ; /*簡化表示鏈表節(jié)點*/typedef struct node *Link;void is_malloc_ok( Link *new_node ) /*為新節(jié)點申請內(nèi)存*/ if( (*new_node) = NULL ) printf( "malloc error!n" ); exit(-1); void create_link( L

27、ink *head ) /*創(chuàng)建帶頭節(jié)點的新的鏈表*/ ( *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 != N