单向链表

/*²åÈëµ½Ò»¸öÓÐÐòµ¥ÏòÁ´±í£¬º¯ÊýµÄ²ÎÊýÊÇÒ»¸öÖ¸ÏòÁ´±íµÚÒ»¸ö½ÚµãµÄÖ¸Õ룬ÒÔ¼°Ò»¸öÐèÒª²åÈëµÄÐÂÖµ*/ #include <stdlib.h> #include <stdio.h> #include "sll_node.h" #define FALSE 0 #define TRUE 1 int sll_insert(register Node **linkp,int new_value) { register Node *current; register Node *new; /*Ñ°ÕÒÕýÈ·µÄ²åÈëλÖ㬷½·¨ÊÇ°´Ðò·ÃÎÊÁ´±í£¬Ö±µ½µ½´ïÒ»¸öÆäÖµ´óÓÚ»òµÈÓÚÐÂÖµµÄ½Úµã*/ while((current = *linkp) != NULL && current->value < new_value) linkp = &current->link; /*Ϊнڵã·ÖÅäÄڴ棬²¢°ÑÐÂÖµ´æ´¢µ½Ð½ڵãÖУ¬Èç¹ûÄÚ´æ·ÖÅäʧ°Ü£¬º¯Êý·µ»ØFALSE*/ new = (Node *)malloc(sizeof(Node)); if(new == NULL) return FALSE; new->value = new_value; /*ÔÚÁ´±íÖвåÈëнڵ㣬²¢·µ»ØTRUE*/ new->link = current; *linkp = new; return TRUE; } 

typedef struct NODE{ struct NODE *link; int value; }Node; sll_node.h

 

单向链表插入的改进

 

/*²åÈëµ½Ò»¸öÓÐÐòµ¥ÏòÁ´±í£¬º¯ÊýµÄ²ÎÊýÊÇÒ»¸öÖ¸ÏòÁ´±í¸ùÖ¸ÕëµÄÖ¸Õ룬ÒÔ¼°Ò»¸öÐèÒª²åÈëµÄÐÂÖµ*/ #include <stdlib.h> #include <stdio.h> #include "sll_node.h" #define FALSE 0 #define TRUE 1 int sll_insert(Node **rootp,int new_value) { Node *current; Node *previous; Node *new; /*µÃµ½Ö¸ÏòµÚÒ»¸ö½ÚµãµÄÖ¸Õë*/ current = *rootp; previous = NULL; /*Ñ°ÕÒÕýÈ·µÄ²åÈëλÖ㬷½·¨ÊÇ°´Ðò·ÃÎÊÁ´±í£¬Ö±µ½µ½´ïÒ»¸öÆäÖµ´óÓÚ»òµÈÓÚÐÂÖµµÄ½Úµã*/ while(current != NULL && current->value < new_value){ previous = current; current = current->link; } /*Ϊнڵã·ÖÅäÄڴ棬²¢°ÑÐÂÖµ´æ´¢µ½Ð½ڵãÖУ¬Èç¹ûÄÚ´æ·ÖÅäʧ°Üº¯Êý·µ»ØFALSE*/ new = (Node *)malloc(sizeof(Node)); if(new == NULL) return FALSE; new->value = new_value; /*°Ñнڵã²åÈëµ½Á´±íÖУ¬²¢·µ»ØTRUE*/ new->link = current; if(previous == NULL) *rootp = new; else previous->link = new; return TRUE; }

 

 

插入函数的参数Node **rootp,使用指针的指针是为了能够让程序访问到root；

特别注意在开头和末尾对链表的插入。

下次复习双向链表