回顾数据结构（Java版）——简单的单链表

淩亂°似流年 2023-06-05 11:19 44阅读 0赞

实现一个简单的单链表主要需要增删改等等，其实都是差不多的，下面就写了几个比较容易混淆的也比较常用的  
插入：头插，尾插，按序插入  
删除：按id删除  
修改：这个更简单就没写了  
查：查找全部的方法，查找单个也很简单

主要是要掌握插入和删除，明白什么时候需要临时变量来辅助操作就很简单了

package com.wrial.linkedlist;
    /*
     * @Author  Wrial
     * @Date Created in 19:09 2019/10/8
     * @Description 单链表结点数据结构
     */
    
    public class Node {
        public int getId() {
            return id;
        }
    
        public String getName() {
            return name;
        }
    
        Node(int id, String name) {
            this.id = id;
            this.name = name;
        }
    
        private int id;
        private String name;
        Node next;
    
        @Override
        public String toString() {
            return "EmpNode{" +
                    "id=" + id +
                    ", name='" + name + '\'' +
                    "}";
        }
    }

package com.wrial.linkedlist;
    /*
     * @Author  Wrial
     * @Date Created in 22:14 2019/10/8
     * @Description
     */
    
    public class SingleLinkedList {
        Node head = new Node(0, "");
    
        public void headAdd(Node node) {
            node.next = head.next;
            head.next = node;
        }
    
        public void tailAdd(Node node) {
    
            Node temp = head;
            while (temp.next != null) {
                temp = temp.next;
            }
            temp.next = node;
        }
    
        public void addByOrder(Node node) {
            Node temp = head;
            while (true){
                if (temp.next.getId()==node.getId()){
                    System.err.println("id不能相等");
                    return;
                }
                if (temp.next.getId()>node.getId()){
                    node.next = temp.next;
                    temp.next = node;
                    break;
                }
                temp = temp.next;
            }
        }
    
        public void removeById(int id) {
            Node temp = head;
    
            while (true) {
                if (temp.next == null) {
                    System.out.println("未找到");
                    break;
                }
                if (id == temp.next.getId()) {
                    System.out.println("找到" + id + "并删除");
                    temp.next = temp.next.next;
                    break;
                }
                temp = temp.next;
            }
        }
    
        public void showData() {
            Node temp = head;
            while (temp.next != null) {
                temp = temp.next;
                System.out.println(temp);
            }
        }
    }

package com.wrial.linkedlist;
    /*
     * @Author  Wrial
     * @Date Created in 19:08 2019/10/8
     * @Description
     */
    
    public class LinkListTest {
        public static void main(String[] args) {
            SingleLinkedList singleLinkedList = new SingleLinkedList();
            singleLinkedList.headAdd(new Node(1,"张三"));
            singleLinkedList.headAdd(new Node(2,"李四"));
            singleLinkedList.tailAdd(new Node(3,"王五"));
    
            singleLinkedList.showData();
    
            singleLinkedList.removeById(2);
    
            singleLinkedList.showData();
    
            singleLinkedList.addByOrder(new Node(2,"新李四"));
            System.out.println("____________________________");
            singleLinkedList.showData();
    
    
        }
    }