手写LinkedList（简易版）

MyLinked代码实现:

package com.lhb.test;

/**
 * @Program: netty-chat
 * @Description:
 * @Author: LHB
 * @Version: v0.0.1
 * @Time: 2021-11-01 09:43
 **/
public class MyLinked {

    private Node head;
    private volatile int length = 0;

    public MyLinked() {
        this.head = new Node();
    }

    public void addFirst(int data) {
        Node node = new Node(data);
        node.next = head;
        head = node;
        this.incrLength();
    }

    public void add(int data) {
        Node temp = head;
        while(temp.next != null) {
            temp = temp.next;
        }
        temp.next = new Node(data);
        this.incrLength();
    }

    public void insert(int loc, int data) {
        if (loc < length) {
            Node temp = head;
            while(loc-1 > 0) {
                temp = temp.next;
                loc--;
            }
            Node node = new Node(data);
            node.next = temp.next;
            temp.next = node;
            this.incrLength();
        } else if(loc <= 1) {
            this.addFirst(data);
        } else if (loc > length) {
            this.add(data);
        }
    }

    public void update(int loc, int data) {
        if (loc < length) {
            Node temp = head;
            while(loc > 0) {
                temp = temp.next;
                loc--;
            }
            temp.data = data;
        }
    }

    public void delete(int loc) {
        if (loc < length) {
            Node temp = head;
            while (loc-1 > 0) {
                temp = temp.next;
                loc--;
            }
            temp.next = temp.next.next;
            this.subLength();
        }
    }

    private synchronized void incrLength() {
        this.length++;
    }

    private synchronized void subLength() {
        this.length--;
    }

    public String toString() {
        return "{length : "+this.length + ", head: "+ head.toString()+"}";
    }

    class Node {
        private int data;
        private Node next;
        public Node() {
            this.data = 0;
            this.next = null;
        }
        public Node(int data) {
            this.data = data;
            this.next = null;
        }

        public Node(int data, Node next) {
            this.data = data;
            this.next = next;
        }

        public String toString() {
            StringBuilder stringBuilder = new StringBuilder();
            stringBuilder.append("{");
            stringBuilder.append("data: " + data);
            stringBuilder.append(", ");
            stringBuilder.append("next: ");
            stringBuilder.append(next == null ? "null" : next.toString());
            stringBuilder.append("}");
            return stringBuilder.toString();
        }
    }
}

Main.java

package com.lhb.test;

/**
 * @Program: netty-chat
 * @Description:
 * @Author: LHB
 * @Version: v0.0.1
 * @Time: 2021-11-01 09:50
 **/
public class LinkedMain {
    public static void main(String[] args) {
        MyLinked myLinked = new MyLinked();
        myLinked.addFirst(5);
        myLinked.addFirst(-1);
        myLinked.add(1);
        myLinked.add(2);
        myLinked.add(3);
        myLinked.insert(2,6);
        myLinked.insert(3,10);
        myLinked.update(3,20);
        myLinked.delete(2);
        System.out.println(myLinked.toString());
    }
}

输出结果: