数据结构2——2.docVIP

using?System; namespace?List { ///?summary ///?Summary?description?for?ListNode. ///?/summary //?结点类 public?class?ListNode { public?ListNode(int?NewValue) { Value=NewValue; } ///?summary ///?前一个 ///?/summary public?ListNode?Previous; ///?summary ///?后一个 ///?/summary public?ListNode?Next; ///?summary ///?值 ///?/summary public?int?Value; } } using?System; namespace?List { ///?summary ///?链表类 ///?/summary 定义结点之后，开始类线性表的操作编程了.在LIST?类中,采用了，Head?,Tail,?Current，三个指针，使用Append?，MoveFrist,MovePrevious，MoveNext,MoveLast?,Delete,InsertAscending,InsertUnAscending?,Clear?实现移动，添加，删除,升序插入，降序插入，清空链表操作，GetCurrentValue（）?方法取得当前的值。 public?class?Clist { public?Clist() {? //构造函数 //初始化 ListCountValue=0; Head=null; Tail=null; } ///?summary ///?头指针 ///?/summary private?ListNode?Head; ///?summary ///?尾指针 ///?/summary private?ListNode?Tail; ///?summary ///?当前指针 ///?/summary private?ListNode?Current; ///?summary ///?链表数据的个数 ///?/summary private?int?ListCountValue; ///?summary ///?尾部添加数据 ///?/summary public?void?Append(int?DataValue?) { ListNode?NewNode=new?ListNode(?DataValue); if?(IsNull())? //如果头指针为空 { Head=NewNode; Tail=NewNode; } else { Tail.Next?=NewNode; NewNode.Previous?=Tail; Tail=NewNode; } Current=NewNode; //链表数据个数加一 ListCountValue+=1; } ///?summary ///?删除当前的数据 ///?/summary public?void?Delete() {? //若为空链表 if?(?!?IsNull()) { //若删除头 if?(IsBof()) { Head=Current.Next?; Current=Head; ListCountValue-=1; return; } //若删除尾 if?(IsEof()) {? Tail=Current.Previous?; Current=Tail; ListCountValue-=1; return; } //若删除中间数据 Current.Previous.Next?=Current.Next?; Current=Current.Previous?; ListCountValue-=1; return; } } ///?summary ///?向后移动一个数据 ///?/summary public?void?MoveNext() { if?(!?IsEof())?Current=Current.Next?; } ///?summary ///?向前移动一个数据 ///?/summary public?void?MovePrevious() { if?(!IsBof())?Current=Current.Previous?; } ///?summary ///?移动到第一个数据 ///?/summary public?vo