单链表的创建与添加
package com.wmq.atguigu.linkedlist;
/**
* 单链表
*/
public class SingleLinkedList {
public static void main(String[] args) {
HeroNode hero1 = new HeroNode(1, "user1", "小王");
HeroNode hero2 = new HeroNode(2, "user2", "小李");
HeroNode hero3 = new HeroNode(3, "user3", "小赵");
HeroNode hero4 = new HeroNode(4, "user4", "小孙");
SingleLinkedListDemo singleLinkedListDemo = new SingleLinkedListDemo();
/*singleLinkedListDemo.add(hero1);
singleLinkedListDemo.add(hero2);
singleLinkedListDemo.add(hero3);
singleLinkedListDemo.add(hero4);
*/
singleLinkedListDemo.addByOrder(hero1);
singleLinkedListDemo.addByOrder(hero4);
singleLinkedListDemo.addByOrder(hero3);
singleLinkedListDemo.addByOrder(hero2);
// singleLinkedListDemo.addByOrder(hero2); //测试用户已经存在
singleLinkedListDemo.list();
}
}
//创建单链表
class SingleLinkedListDemo{
//初始化一个头节点
private HeroNode head = new HeroNode(0,"","");
//添加节点
public void add(HeroNode heroNode){
HeroNode temp = head;
while (true){
if (temp.next == null){
break;
}
temp = temp.next;
}
temp.next = heroNode;
}
//添加节点的第二种方法,按照顺序添加
public void addByOrder(HeroNode heroNode){
HeroNode temp = head;
boolean flag = false;
while (true){
if (temp.next == null){
break;
}
if (temp.next.no > heroNode.no){
break;
}else if (temp.next.no == heroNode.no){
flag = true;
break;
}
temp = temp.next;
}
if (flag){
System.out.println("用户已经存在了");
}else{
heroNode.next = temp.next;
temp.next = heroNode;
}
}
//显示链表
public void list(){
//判断链表是否为空
if (head.next == null){
System.out.println("链表为空");
return;
}
HeroNode temp = head.next;
while (true){
if (temp == null){
break;
}
System.out.println(temp);
temp = temp.next;
}
}
}
//定义HeroNode,每个HeroNode对象就是一个节点
class HeroNode{
public int no;
public String name;
public String nickname;
public HeroNode next;
public HeroNode(int no,String name,String nickname){
this.no = no;
this.name = name;
this.nickname = nickname;
}
@Override
public String toString() {
return "HeroNode{" +
"no=" + no +
", name='" + name + '\'' +
", nickname='" + nickname + '\'' +
'}';
}
}