Day553.单链表 -数据结构和算法Java

Posted 2022-03-09 阿昌喜欢吃黄桃

单链表

一、链表介绍

二、单链表介绍

三、单链表应用实例

1、插入数据，插入单链表尾部案例

package com.achang.linkedlist;

/**
 * @Author Achang
 * @Date 2022/3/8 21:26
 * 单链表
 **/
public class SingleLinkedListDemo 
    public static void main(String[] args) 
        HeroNode node1 = new HeroNode(1, "宋江", "及时雨");
        HeroNode node2 = new HeroNode(2, "卢俊义", "玉麒麟");
        HeroNode node3 = new HeroNode(3, "吴用", "智多星");
        HeroNode node4 = new HeroNode(4, "林冲", "豹子头");

        SingleLinkedList singleLinkedList = new SingleLinkedList();
        singleLinkedList.add(node1);
        singleLinkedList.add(node2);
        singleLinkedList.add(node3);
        singleLinkedList.add(node4);

        singleLinkedList.list();
    


class SingleLinkedList
    //初始化有节点，不存放具体的数据
    private HeroNode head = new HeroNode(0,"","");
    public void add(HeroNode node)
        HeroNode temp = head;
        while (true)
            //找到链表最后
            if (temp.next == null)
                break;
            else 
                temp = temp.next;
            
        
        temp.next = node;
    
    
    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);
            //next后移
            temp = temp.next;
        
    


class HeroNode
    public int no;
    public String name;
    public String nickName;
    public HeroNode next;

    @Override
    public String toString() 
        return "no="+no+",name="+name+",nickName="+nickName;
    

    public HeroNode(int no, String name, String nickName)
        this.name=name;
        this.nickName = nickName;
        this.no = no;
    

二、根据Node序号，插入指定链表位置案例

如果存在就添加失败，并给出提示

明天继续！！！