利用链结串列.pptxVIP

Data Structure in C  ─ 鏈結串列;1;2;3;4;5;6;Step 1: x = (struct node *) malloc(sizeof(struct node)); x-next = NULL;;Step 3: head = x;;Step 2: tail-next = x;;Step 1: x = (struct node *) malloc(sizeof(struct node)); x-next = NULL;;Step 3: ptr-next = x;;void insert_node(struct node *ptr, struct node *head, struct node *tail) { struct node *this if(head == NULL) /* 插入資料為第一筆 */ { ptr-next=NULL; head=ptr; tail=ptr;} else { this=head; if(ptr-key this-key) /* 插入位置為前端 */ { ptr-next=this; head=ptr; } ; else {while(this-next != NULL) { prev=this; this=this-next; if(ptr-key this-key) /* 插入位置於中間 */ { ptr-next=this; prev-next=ptr; break; } } if(ptr-key = this-score) /* 插入資料於尾端 */ { ptr-next=NULL; this-next=ptr; tail=ptr; } } } };14;Step 1: ptr = head;;刪除串列尾端的節點;刪除串列某一特定節點;Step 2: prev-next = this-next;;void delete_f(int del_key, struct node *head, struct node *tail) { struct node *clear, *this, *prev; this=head; if(del_key == head-key) { /* 刪除資料於前端 */ clear=this; if(head-next == NULL) /* 資料僅存在一筆 */ tail=NULL; head=head-next; free(clear); } while(this-next != NULL) { /* 刪除資料於中間 */ prev=this; this=this-next; if (del_key == this-key) { clear=this; prev-next=this-next; free(clear); } } if(del_key == tail-key) { /*刪除資料於尾端 */ clear=this; prev-next=NULL; tail=prev; free(clear); };20;void concatenate (struct node *x, struct node *y, struct node *y) { struct node *c; if (x = = NULL) z = y; else if (y = = NULL) z = x; else { z=x; c=x; while(c-next != NULL) c = c-next; c-next = y; } };將一串列反轉 串列的反轉是將原先的串列首變成串列尾 Ex. 若一串列原先以小排到大，此時若想由大到小排列 void invert(struct node *head) { struct node *this, *prev, *next_n; next_n = head; this =NULL; while(next_n != NULL){ prev = this; this = next_n; next_n =