单链表的创建与添加

单链表的创建与添加

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 + '\'' +
                '}';
    }
}

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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值