正序鏈表的建立.doc

1、正序鏈表的建立建立正序鏈表請(qǐng)按照輸入整數(shù)的順序建立一個(gè)正序的帶表頭節(jié)點(diǎn)的鏈表。已知程序的基本結(jié)構(gòu)如下，請(qǐng)你編寫 ins_list函數(shù)。 鏈表問題很不懂。求看 ins_list函數(shù)有什么問題，別的都是題目已經(jīng)給出來的代碼。/* PRESET CODE BEGIN - NEVER TOUCH CODE BELOW */#include stdio.hstruct nodeint data;struct node * next; ;typedef struct node NODE;typedef struct node * PNODE;int main ( )int num=1;PNODE head

2、;head = (PNODE)malloc( sizeof(NODE) );head-next = NULL;head-data = -1;while ( num!=0 )scanf(%d, &num);if ( num!=0 )ins_list( head, num);outlist( head );return 0;outlist( PNODE head )PNODE p;p = head-next;while ( p != NULL )printf(%dn, p-data);p = p-next;ins_list( PNODE h, int num )NODE *q,*p;int n=0

3、;p-next=NULL;p-data=num;for(q=h; q-next!=NULL; n+)q=q-next;q-next=p;分享到 :-解決方案 -那兩個(gè)函數(shù)都沒有返回類型，沒有返回類型的，可以寫void-解決方案 -改了下/* PRESET CODE BEGIN - NEVER TOUCH CODE BELOW */ /#include stdio.h#include #include struct nodeint data;struct node * next; ;typedef struct node NODE;typedef struct node * PNODE;void

4、 ins_list( PNODE h, int num );void outlist( PNODE head );int main ( )int num=1;PNODE head;head = (PNODE)malloc( sizeof(NODE) );head-next = NULL;head-data = -1;while ( num!=0 )scanf(%d, &num);if ( num!=0 )ins_list( head, num); outlist( head );return 0;void outlist( PNODE head ) PNODE p;p = head-next;

5、while ( p != NULL )printf(%dn, p-data);p = p-next;void ins_list( PNODE h, int num ) NODE *q,*p;p = (PNODE)malloc( sizeof(NODE) ); /p-data=num;for(q=h; q-next!=NULL; )q=q-next;q-next=p;添加p-next=NULL;-解決方案-單是NODE *p;的話只是定義指針，沒有分配內(nèi)存，-解決方案-僅供參考/ 假設(shè)帶表頭結(jié)點(diǎn)的單向鏈表頭指針為 head，試編寫一個(gè)算法將值為 5 的結(jié)點(diǎn)插入到連接表的第 k 個(gè)結(jié)點(diǎn)前，刪除第k

6、 個(gè)節(jié)點(diǎn)，并對(duì)該鏈表進(jìn)行排序。#include #include #include #include struct NODE intdata;struct NODE *next; H,*head,*p,*q,*s1,*s2,*s3,*s4,*s; int i,j,k,n,t;int main() srand(time(NULL);/ 填寫頭節(jié)點(diǎn)數(shù)據(jù)H.data=-1;H.next=NULL;head=&H;/ 創(chuàng)建 10 個(gè)節(jié)點(diǎn)的單鏈表p=head;for (i=0;idata=rand()%100;/填寫0.99的隨機(jī)值q-next=NULL;p-next=q;p=q;/ 輸出整個(gè)單鏈表s=

7、head-next;while (1) if (NULL=s) printf(n);break;printf(%02d-,s-data);s=s-next;/ 將值為 5 的結(jié)點(diǎn)插入到單鏈表的第 k 個(gè)結(jié)點(diǎn)前k=3;n=0;p=head;while (1) if (NULL=p) break;n+;if (k=n) q=(struct NODE *)malloc(sizeof(struct NODE);if (NULL=q) return 1;q-data=5;q-next=p-next;p-next=q;break;p=p-next;/ 輸出整個(gè)單鏈表s=head-next;while (1

8、) if (NULL=s) printf(n);break;printf(%02d-,s-data);s=s-next;/ 刪除第 k 個(gè)節(jié)點(diǎn)k=5;n=0;p=head;while (1) if (NULL=p) break;n+;if (k=n) q=p-next;if (q) p-next=q-next;free(q);break;p=p-next;/ 輸出整個(gè)單鏈表=head-next; swhile (1) if (NULL=s) printf(n);break;printf(%02d-,s-data);s=s-next;/ 從小到大排序for (p=head;p!=NULL & p

9、-next!=NULL;p=p-next) for (q=p-next;q!=NULL & q-next!=NULL;q=q-next) if (p-next-data q-next-data) / 交換 data/ printf(swap %02d %02dn,p-next-data,q-next-data);/ t=p-next-data;p-next-data=q-next-data;q-next-data=t;/ 或者/ 交換 next / printf(swap %02d %02dn,p-next-data,q-next-data); s1=p-next; s2=p-next-nex

10、t;s3=q-next; s4=q-next-next;if (s2!=s3) s3-next=s2;q-next=s1;s1-next=s4;p-next=s3; else p-next=s3;s3-next=s1;q=s3;s1-next=s4;/ 輸出整個(gè)單鏈表 / s=head-next; / while (1) / (NULL=s) / printf(n); / break; / if/ printf(%02d-,s-data);/s=s-next; /getchar(); / 輸出整個(gè)單鏈表s=head-next;while (1) if (NULL=s) printf(n);br

11、eak;printf(%02d-,s-data);s=s-next;/ 釋放所有節(jié)點(diǎn)p=head-next;while (1) if (NULL=p) break;q=p-next;free(p);p=q;return 0;/29-82-10-22-71-05-13-60-59-39-/29-82-05-10-22-71-05-13-60-59-39-/29-82-05-10-71-05-13-60-59-39-/05-05-10-13-29-39-59-60-71-82-/-解決方案 -#include stdio.h#include struct node幫你修改了一下int data;s

12、truct node * next; ;typedef struct node NODE;typedef struct node * PNODE;int outlist( PNODE head )PNODE p;p = head-next;while ( p != NULL )printf(%dn, p-data);p = p-next;return 1;void ins_list( PNODE h, int num )NODE * r,* p;r=h;while(r-next!=NULL)r=r-next;p=(PNODE)malloc(sizeof(NODE);p-data=num;p-next=NULL;/p為待插結(jié)點(diǎn)if(h-next=NULL)h-next=p;r=p;elser-next=p;r=r-next;int main ( )int num=1;PNODE head;head =