线性表链接存储(单链表)操作的16种算（Linear table linked storage (single linked list) operation of the 16 calculations）.docVIP

下载本文档

1
0
约3.07千字
约 12页
2017-07-27 发布于河南
举报
版权申诉

线性表链接存储(单链表)操作的16种算（Linear table linked storage (single linked list) operation of the 16 calculations）.doc

1、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。。
2、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
4、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
5、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
6、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
7、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

线性表链接存储(单链表)操作的16种算（Linear table linked storage (single linked list) operation of the 16 calculations）

线性表链接存储(单链表)操作的16种算（Linear table linked storage (single linked list) operation of the 16 calculations） 9. / to single list header, insert an element. Void insertFirstList (struct, sNode*, *hl, elemType, x) { Struct sNode *newP; NewP = malloc (sizeof (struct, sNode)); If (newP = = NULL) { Printf (memory allocation failed, quit running! ); Exit (1); } NewP-data = x; NewP-next = *hl; *hl = newP; Return; } At the end of the 10. / to add a single list of elements. Void insertLastList (struct, sNode*, *hl, elemType, x) { Struct sNode *newP; NewP = malloc (sizeof (struct, sNode)); If (newP = = NULL) { Printf (internal allocation failed, quit running! ); Exit (1); } NewP-data = x; NewP-next = NULL; If (*hl = = NULL) { *hl = newP; } Else{ Struct, sNode, *p = NULL; While (p-next = = NULL) { P = p-next; } P-next = newP; } Return; } 11. to a single table in the first POS node insertion element x node, if inserted successfully returned 1, otherwise return 0*/ Int insetPosList (struct, sNode*, *hl, int, POS, elemType, x) { Int i = 0; Struct sNode *newP; Struct, sNode, *cp = *hl, *ap = NULL; If (POS = 0) { Printf (POS value is illegal, returns 0 means insertion failed! ); Return 0; } While (CP = = NULL) { I++; If (POS = = I) { Break; }else{ AP = cp; CP = cp-next; } } NewP = malloc (sizeof (struct, sNode)); If (newP = = NULL) { Printf (memory allocation failed, unable to insert operation! ); Return 0; } NewP-data = x; If (AP = = NULL) { NewP-next = cp; *hl = newP; } Else{ NewP-next = cp; Ap-next = newP; } Return 1; } 12. to order a single linked list to insert the elements of X node, which is still in an orderly manner after insertion. Void insertOrderList (struct, sNode*, *hl, elemType, x) { Struct, sNode, *cp = *hl, *ap = NULL; Struct sNode *newP; NewP = malloc (sizeof (struct, sNode)); If (newP = = NULL) { Printf (internal allocation failed, quit running! ); Exit (1); } NewP-data = x; If ((CP = = NULL) || (x cp-data)) { NewP-next = cp; *hl = newP; Return; } While (CP = = NULL)