数据结构课程设计报告--双向循环链表的创建及相关操作的实现

ve(){ intj=0; Scannersc=newScanner(System.in); System.out.println("4.该步骤执行删除节点操作"); System.out.println("a.请输入要删除节点的个数:"); intn=sc.nextInt(); for(inti=0;i<n;i++){ System.out.println("b.请输入要删除节点的位置:"); intindex=sc.nextInt(); if(index<0||index>=size()) { System.out.println("数组越界"); }elseif(index==0||size()==1){ if(size()==0){ beginMarker.next=null; endMarker=null; }else{ Node<AnyType>fitst=beginMarker.next; beginMarker.next=fitst.next; fitst=null; } }elseif(index==(size()-1)){ if(size()==1) { if(size()==0){ beginMarker.next=null; endMarker=null; }else{ Node<AnyType>fitst=beginMarker.next; beginMarker.next=fitst.next; fitst=null; } } else{ Node<AnyType>pre=endMarker.previous; pre.next=null; endMarker=pre; endMarker.next=beginMarker; endMarker=null; } }else{ Node<AnyType>prior=beginMarker.next;