publicclassSingleLinkedListDemo {publicstaticvoidmain(String[] args) {//测试//先创建节点HeroNode hero1 =newHeroNode(1, "宋江", "及时雨");HeroNode hero2=newHeroNode(2, "卢俊义", "玉麒麟");HeroNode hero3=newHeroNode(3, "吴用", "智多星");HeroNode hero4=newHeroNode(4, "林冲", "豹...
singleLinkedList.list(); //测试修改节点的代码 HeroNode newHeroNode =new HeroNode(2,"小卢","玉麒麟~~"); singleLinkedList.update(newHeroNode); System.out.println("修改后的链表情况~~"); singleLinkedList.list(); //删除一个节点 singleLinkedList.del(1); singleLinkedList.del(4); System.out....
//定义SingleLinkedList 管理英雄classSingleLinkedList{// 初始化一个头节点 不存放具体数据privateHeroNodehead=newHeroNode(0,"","");// 添加节点到单向链表publicvoidadd(HeroNode heroNode){// 当不考虑编号的顺序时:// 1、找到当前链表的最后节点// 2、将最后这个节点的next域指向新的节点即可// 因为head...
package linkedlist; public class SingleLinkedList { public static void main(String[] args) { //进行测试 //先创建节点 HeroNode hero1 = new HeroNode(1, "宋江", "及时雨"); HeroNode hero2 = new HeroNode(2, "卢俊义", "玉麒麟"); HeroNode hero3 = new HeroNode(3, "吴用", "智多星")...
(); singleLinkedList.addByOrder(hero1); singleLinkedList.addByOrder(hero3); singleLinkedList.addByOrder(hero4); singleLinkedList.addByOrder(hero2);//修改节点HeroNode newHeroNode =newHeroNode(2,"小卢","~玉麒麟~"); singleLinkedList.update(newHeroNode);// 显示链表singleLinkedList.list(); }...
创建一个名为SingleLinkedList.java的 java 文件。 package org.arpit.java2blog;classNode{publicintdata;publicNode next;publicvoiddisplayNodeData(){ System.out.println("{ "+ data +" } "); } }publicclassSinglyLinkedList{privateNode head;publicbooleanisEmpty(){return(head ==null); ...
测试类:LinkedSinglyCircularListDemo package cn.linkedlist.demo06; public class SingleCircleLinkedListDemo { public static void main(String[] args) { SingleCircleLinkedList<Integer> singleLinkedList = new SingleCircleLinkedList<>(); singleLinkedList.add(0,1); ...
singleLinkedList.add(hero2); singleLinkedList.add(hero3); //显示一把 singleLinkedList.list(); } } //定义SingleLinkedList 管理我们的英雄 class SingleLinkedList{ //先初始化一个头节点,头节点不要动,不存放具体的数据 private HeroNode head = new HeroNode(0, "", "") ; ...
singleLinkedList.addByOrder(hero2); //测试一下 求单链表中有效节点的个数 System.out.println("有效的节点个数 = " + getLength(singleLinkedList.getHead())); System.out.println("反转之前的单链表:"); singleLinkedList.list(); //单向链表的反转 ...
class [klɑ:s] 类 classpath [klɑ:s’pɑ:θ ]类路径 public ['p ʌblik] 公共的,公用的 private ['praivit] 私有的,私人的 static ['stæ tik] 静的;静态的;静止的 void [vɔid]空的,没有返回值的 path [ pɑ:θ ] 路径