数据结构-单链表

单链表

单链表逻辑结构

• 链表是以节点的方式来储存，是链式储存

• 每个节点包含data域（数据存放），next域（指向下一个节点）

• 链表的各个节点不一定连续存储

• 链表分带头节点的和不带头节点的

单链表的基础应用（增删改查）

单链表创建图示（不考虑顺序，直接将数据插入链表尾部

单链表创建图示（考虑顺序，需要遍历进行比较）

package hai.sparse;

public class SignLinked {
    public static void main(String[] args) {
        HeroNode heroNode1 = new HeroNode(1, "曾紫钰", "大傻猪");
        HeroNode heroNode2 = new HeroNode(2, "周海斌", "大帅哥");
        HeroNode heroNode3 = new HeroNode(3, "zzy", "大笨猪");
        HeroNode heroNode4 = new HeroNode(4, "zhb'", "大聪明");
        SignLinkedList signLinkedList = new SignLinkedList();
        /*
        signLinkedList.add(heroNode3);
        signLinkedList.add(heroNode1);
        signLinkedList.add(heroNode2);
        signLinkedList.add(heroNode4);
        */
        signLinkedList.addBy(heroNode3);
        signLinkedList.addBy(heroNode1);
        signLinkedList.addBy(heroNode2);
        signLinkedList.addBy(heroNode4);
        HeroNode heroNode5 = new HeroNode(6,"zzy","大懒猪");
        signLinkedList.addBy(heroNode5);
        signLinkedList.list();
        signLinkedList.delate(5);
        signLinkedList.find(6);
        System.out.println("-----------------------------");
        signLinkedList.list();
        System.out.println(getLength((signLinkedList.getHead())));
        reversetList(signLinkedList.getHead());
        signLinkedList.list();
    }
    //获取链表长度
    public static int getLength(HeroNode head){
        HeroNode temp = head.next;
        int length = 0;
        while(temp!=null){
            length++;
            temp = temp.next;
        }
        return length;
    }
    //反转链表
    public static void reversetList(HeroNode head){
        HeroNode temp = head.next;
        HeroNode reversehead = new HeroNode(0,"","");
        HeroNode cur = null;
        if(temp ==null || temp.next.next==null){
            return ;
        }
        while(temp!=null){
            cur = temp.next;//保存当前节点的下一个节点
            temp.next = reversehead.next;//将temp的下一个节点指向新的链表的最前端
            reversehead.next = temp;//将temp连接到新链表上
            temp = cur;//temp后移
        }
        head.next = reversehead.next;
    }
}
//定义链表
class SignLinkedList {
    private HeroNode head = new HeroNode(0,"","");

    public HeroNode getHead() {
        return head;
    }

    //无顺序添加
    public void add(HeroNode heroNode){
        HeroNode temp = head;
        while(temp.next!=null){
            temp = temp.next;
        }
        temp.next = heroNode;
    }
    //遍历输出
    public void list(){
        if(head.next==null){
            System.out.println("链表为空");
            return;
        }
        HeroNode temp = head.next;
        while(temp!=null){
            System.out.println(temp);
            temp = temp.next;
        }
    }
    //有顺序添加
    public void addBy(HeroNode heroNode){
        HeroNode temp = head;
        Boolean flag = false;
        while(temp.next!=null){
            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("该数值已经存在" + heroNode.no);
        }else{
            heroNode.next = temp.next;
            temp.next = heroNode;
        }
    }
    //修改数据
    public void update(HeroNode heroNode){
        HeroNode temp  = head;
        if(head.next==null){
            System.out.println("该链表为空");
            return;
        }
        Boolean flag = true;
        while(temp.next!=null){
            if(temp.next.no==heroNode.no){
                temp.next.name=heroNode.name;
                temp.next.nickname=heroNode.nickname;
                flag = false;
                break;
            }
            temp = temp.next;
        }
        if(flag){
            System.out.println("没有找到该数据" + heroNode.no);
        }
    }
    //删除数据
    public void delate(int no){
        HeroNode temp = head;
        Boolean flag= true;
        while(temp.next!=null){
            if(temp.next.no==no){
                temp.next=temp.next.next;
                flag = false;
                break;
            }
            temp = temp.next;
        }
        if(flag){
            System.out.println("未找到该数据" + no);
        }
    }
    //查找数据
    public void find(int no){
        HeroNode temp = head;
        Boolean flag = true;
        while (temp.next!=null){
            if(temp.next.no==no){
                System.out.println(temp.next);
                flag=false;
                break;
            }
            temp = temp.next;
        }
        if(flag){
            System.out.println("未找到该数据");
        }
    }
}
//定义结点
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 + '\'' +
                '}';
    }
}