预览加载中,请您耐心等待几秒...
1/5
2/5
3/5
4/5
5/5

在线预览结束,喜欢就下载吧,查找使用更方便

如果您无法下载资料,请参考说明:

1、部分资料下载需要金币,请确保您的账户上有足够的金币

2、已购买过的文档,再次下载不重复扣费

3、资料包下载后请先用软件解压,在使用对应软件打开

C#数据结构之循环链表的实例代码C#数据结构之循环链表的实例代码很多人都不知道C#数据结构中循环链表的代码怎么写,下面小编为大家整理了C#数据结构之循环链表的实例代码,希望能帮到大家!复制代码代码如下:publicclassNode{publicobjectElement;publicNodeLink;publicNode(){Element=null;Link=null;}publicNode(objecttheElement){Element=theElement;Link=null;}}复制代码代码如下:publicclassLinkedList{//头结点protectedNodeHeader;privateintcount;publicLinkedList(){count=0;Header=newNode("header");Header.Link=Header;}publicboolIsEmpty(){return(Header.Link==null);}publicvoidMakeEmpty(){Header.Link=null;}publicvoidPrintList(){Nodecurrent=newNode();current=Header;while(current.Link.Element.ToString()!="header"){Console.WriteLine(current.Link.Element);current=current.Link;}}privateNodeFindPrevious(objectn){Nodecurrent=Header;while(!(current.Link==null)&&current.Link.Element!=n){current=current.Link;}returncurrent;}privateNodeFind(objectitem){Nodecurrent=newNode();current=Header.Link;while(current.Element!=item){current=current.Link;}returncurrent;}publicvoidInsert(objectnewItem,objectafter){Nodecurrent=newNode();NodenewNode=newNode(newItem);current=Find(after);newNode.Link=current.Link;current.Link=newNode;count++;}publicvoidRemove(objectn){Nodep=FindPrevious(n);if(!(p.Link==null)){p.Link=p.Link.Link;count--;}}publicvoidInsertFirst(objectn){Nodecurrent=newNode(n);current.Link=Header;Header.Link=current;count++;}publicNodeMove(intn){Nodecurrent=Header.Link;Nodetmp;for(inti=0;i<=n;i++){current=current.Link;}if(current.Element.ToString()=="header"){current=current.Link;}tmp=current;returntmp;}publicNodeGetFirst(){returnHeader;}}