java循环列表_单向循环列表(Java实现)

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);

}

}

}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值