packagesincyclinkedlist;public classSinCycLinkedListTest {public static voidmain(String[] args) {
Node head= new Node(100);
SinCycLinkedList list= newSinCycLinkedList(head);if(SinCycLinkedList.is_empty(list.head)) {
System.out.println("链表为空,添加元素麻利的~");
System.out
.println("************************************************");
System.out.println("链表的长度为:" +SinCycLinkedList.length(list.head));
SinCycLinkedList.travel(list.head);
System.out
.println("************************************************");
System.out.println("头部插入节点");
SinCycLinkedList.add(list,10);
SinCycLinkedList.add(list,20);
SinCycLinkedList.add(list,30);
SinCycLinkedList.add(list,15);
SinCycLinkedList.add(list,25);
System.out.println("链表的长度为:" +SinCycLinkedList.length(list.head));
SinCycLinkedList.travel(list.head);
System.out
.println("************************************************");
System.out.println("尾部插入几个节点");
SinCycLinkedList.append(list,100);
SinCycLinkedList.append(list,200);
SinCycLinkedList.append(list,500);
SinCycLinkedList.append(list,400);
SinCycLinkedList.append(list,300);
System.out.println("链表的长度为:" +SinCycLinkedList.length(list.head));
SinCycLinkedList.travel(list.head);
System.out
.println("************************************************");
SinCycLinkedList.insert(list,1, 77);
SinCycLinkedList.insert(list,0, 88);
SinCycLinkedList.insert(list,
SinCycLinkedList.length(list.head)- 1, 66);
SinCycLinkedList.insert(list, SinCycLinkedList.length(list.head),55);
SinCycLinkedList.insert(list,5, 44);
System.out.println("链表的长度为:" +SinCycLinkedList.length(list.head));
SinCycLinkedList.travel(list.head);
System.out
.println("************************************************");
System.out.println("查找节点----");
System.out.println(SinCycLinkedList.search(list.head,88));
System.out.println(SinCycLinkedList.search(list.head,25));
System.out.println(SinCycLinkedList.search(list.head,55));
System.out.println(SinCycLinkedList.search(list.head,157));
System.out
.println("************************************************");
System.out.println("删除几个节点试试....");
SinCycLinkedList.remove(list,88);
SinCycLinkedList.remove(list,55);
SinCycLinkedList.remove(list,300);
SinCycLinkedList.remove(list,44);
SinCycLinkedList.remove(list,25);
System.out.println("链表的长度为:" +SinCycLinkedList.length(list.head));
SinCycLinkedList.travel(list.head);
}else{
System.out.println("链表的长度为:" +SinCycLinkedList.length(list.head));
SinCycLinkedList.travel(list.head);
System.out
.println("************************************************");
System.out.println("头部插入节点");
SinCycLinkedList.add(list,10);
SinCycLinkedList.add(list,20);
SinCycLinkedList.add(list,30);
SinCycLinkedList.add(list,15);
SinCycLinkedList.add(list,25);
System.out.println("链表的长度为:" +SinCycLinkedList.length(list.head));
SinCycLinkedList.travel(list.head);
System.out
.println("************************************************");
System.out.println("尾部插入几个节点");
SinCycLinkedList.append(list,100);
SinCycLinkedList.append(list,200);
SinCycLinkedList.append(list,500);
SinCycLinkedList.append(list,400);
SinCycLinkedList.append(list,300);
System.out.println("链表的长度为:" +SinCycLinkedList.length(list.head));
SinCycLinkedList.travel(list.head);
System.out
.println("************************************************");
SinCycLinkedList.insert(list,1, 77);
SinCycLinkedList.insert(list,0, 88);
SinCycLinkedList.insert(list,
SinCycLinkedList.length(list.head)- 1, 66);
SinCycLinkedList.insert(list, SinCycLinkedList.length(list.head),55);
SinCycLinkedList.insert(list,5, 44);
System.out.println("链表的长度为:" +SinCycLinkedList.length(list.head));
SinCycLinkedList.travel(list.head);
System.out.println("查找节点----");
System.out.println(SinCycLinkedList.search(list.head,88));
System.out.println(SinCycLinkedList.search(list.head,25));
System.out.println(SinCycLinkedList.search(list.head,55));
System.out.println(SinCycLinkedList.search(list.head,157));
System.out
.println("************************************************");
System.out.println("删除几个节点试试....");
SinCycLinkedList.remove(list,88);
SinCycLinkedList.remove(list,55);
SinCycLinkedList.remove(list,300);
SinCycLinkedList.remove(list,44);
SinCycLinkedList.remove(list,25);
System.out.println("链表的长度为:" +SinCycLinkedList.length(list.head));
SinCycLinkedList.travel(list.head);
}
}
}