3-2 试编写一个算法,在带表头结点的单链表中寻找第i个 - bytvucom235(3-2 try to write an algorithm, in the list of nodes with a header to find the first I - bytvucom235).docVIP
- 1、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。。
- 2、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载。
- 3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
- 4、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
- 5、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们。
- 6、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
- 7、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
3-2 试编写一个算法,在带表头结点的单链表中寻找第i个 - bytvucom235(3-2 try to write an algorithm, in the list of nodes with a header to find the first I - bytvucom235)
3-2 试编写一个算法,在带表头结点的单链表中寻找第i个 - bytvucom235(3-2 try to write an algorithm, in the list of nodes with a header to find the first I - bytvucom235)
30, energy-saving, such as the analysis of the Tao Yuanming phase of doubt
The third chapter answers questions
3-2, try to write an algorithm, in the list of nodes with a header to find the first I node
If found, the function returns the address of the first I node; if not found, the function returns 0
[answer]
Template class Type
ListNode Type * List Type:: GetANode (int, I) {
Get / / single list to the I node address, I start counting from 0, I 0 pointer 0, I = 0 return header node address
If (I, 1) return NULL;
ListNode Type * P = first; int = k = 0;
While (P! = NULL K I) {P = p-link; k++;}
Return p;
}
3-3 set HA and Hb, respectively, with two header nodes of the non decreasing order of single linked list header pointer, try to design an algorithm, the two ordered linked list is merged into a non increasing order of single linked list
The result list still uses the storage space of the original two linked lists, and does not occupy any other storage space
Duplicate data is allowed in the table
[answer]
#include iostream.h
Template, class, Type, class, List;
Template, class, Type, class, ListNode {
Friend class ListType;
Public:
(ListNode); / / constructor
ListNode (const Type item); / / constructor
Private:
Type data;
ListNodeType *link;
};
Template, class, Type, class, List {
Public:
List (const Type finishied); / / the establishment of the list
Void (Browse); / / print list
Void Merge (ListType hb); / / connection list
Private:
ListNodeType, *first, *last;
};
The realization of the function of member / /
Template class Type
ListNodeType:: ListNode (): link (NULL) {}
/ / constructor, only to initialize the pointer member
Template class Type
ListNodeType:: ListNode (const Type item): data (item), link (NULL) {}
/ / constructor initialization data and pointer members
Template class Type
ListType:: List (const, Type,
您可能关注的文档
- (转)什么是西南大旱的最坏准备_月是故乡明_新浪博客((trans) what's the worst preparation for a drought in Southwest China _ is home next month _ Sina blog).doc
- (人教版)八年级下册语文课后生字词拼音及解释(完整版)((PEP) grade eight Chinese Pinyin words epigenetic and interpretation (full version)).doc
- 0-90度正弦值(0-90 degree sine).doc
- - 上海lng加气站 上海cng加气站博客上海lng加气站 上海cng加气站博客(- Shanghai LNG filling station, Shanghai CNG filling station blog, Shanghai LNG filling station, Shanghai CNG filling station blog).doc
- 010年顺义区中考二模数学试题(010 years of Shunyi District senior high school entrance examination mathematics examination the second mock exam).doc
- (设计)工作细则 - 上海工程技术大学 继续教育学院((Design) working rules - Continuing Education College of Shanghai University of Engineering Science).doc
- 02-03第一学期初三语文试卷52898(02-03 Chinese exam paper for the first semester 52898).doc
- 020我国基层群众自治制度地位的重大提升(020, the important promotion of our country's grass-roots mass autonomy system).doc
- 05-2-1.汉王降价,能降出个怎样的未来(05-2-1. Hanvon prices can drop out of what the future).doc
- 05.无形资产(5 intangible assets).doc
- 3-2 试编写一个算法,在带表头结点的单链表中寻找第i个 - bytvucom275(3-2 try to write an algorithm, in the list of nodes with a header to find the first I - bytvucom275).doc
- 3-2 试编写一个算法,在带表头结点的单链表中寻找第i个 - bytvucom259(3-2 try to write an algorithm, in the list of nodes with a header to find the first I - bytvucom259).doc
- 3-2 试编写一个算法,在带表头结点的单链表中寻找第i个 - bytvucom283(3-2 try to write an algorithm, in the list of nodes with a header to find the first I - bytvucom283).doc
- 20年拐点 中国特色企业培训直销(20 year inflection point, Chinese characteristics, enterprise training, direct marketing).doc
- 3-2 试编写一个算法,在带表头结点的单链表中寻找第i个 - bytvucom323(3-2 try to write an algorithm, in the list of nodes with a header to find the first I - bytvucom323).doc
- 3-2 试编写一个算法,在带表头结点的单链表中寻找第i个 - bytvucom291(3-2 try to write an algorithm, in the list of nodes with a header to find the first I - bytvucom291).doc
- 3-2 试编写一个算法,在带表头结点的单链表中寻找第i个 - bytvucom331(3-2 try to write an algorithm, in the list of nodes with a header to find the first I - bytvucom331).doc
- 3-2 试编写一个算法,在带表头结点的单链表中寻找第i个 - bytvucom339(3-2 try to write an algorithm, in the list of nodes with a header to find the first I - bytvucom339).doc
- 3-2 试编写一个算法,在带表头结点的单链表中寻找第i个 - bytvucom371(3-2 try to write an algorithm, in the list of nodes with a header to find the first I - bytvucom371).doc
- 3-2 试编写一个算法,在带表头结点的单链表中寻找第i个 - bytvucom347(3-2 try to write an algorithm, in the list of nodes with a header to find the first I - bytvucom347).doc
文档评论(0)