JAVA--链表基础

版权声明：本文为博主原创文章，未经博主允许不得转载。 https://blog.csdn.net/caoshiminYQS/article/details/86546077

接口：

public interface Link {

    void add(Object data);
    void print();
    int size();
    boolean isEmpty();
    boolean contains(Object data);
    Object get(int index);
    void set(int index,Object data);
    void remove(Object data);

}

 实体类：

public class LinkImo1 implements Link {

    private class Node {
        private Object data;
        private Node next;

        //节点
        private Node(Object data) {
            this.data = data;
        }

        //添加节点
        private void addNode(Node newNode) {
            if (this.next == null){
                this.next = newNode;
            }else {
                this.next.addNode(newNode);
            }
        }

        //打印节点
        private void printNode() {
            System.out.println(this.data);
            if (this.next == null){
                return;
            }else {
                this.next.printNode();
            }
        }
        //是否包含节点
        private boolean containsNode(Object data) {
            if (this.data.equals(data)){
                return true;
            }else if (this.next == null){
                return false;
            }else {
                return this.next.containsNode(data);
            }
        }
        //获取节点
        private Object getNode(int index) {
            if (foot++ == index){
                return this.data;
            }else {
                return this.next.getNode(index);
            }
        }
        //设置节点
        private void setNode(int index, Object data) {
            if (foot++ == index){
                this.data=data;
            }else {
                this.next.setNode(index,data);
            }

        }
        //移除节点
        private void removeNode(Node node, Object data) {
            if (this.data.equals(data)){
                node.next = this.next;
            }else if (this.next == null){
                return;
            }else {
                this.next.removeNode(this,data);
            }
            count--;
        }
    }


    private Node root;
    private int count = 0;
    private int foot = 0;

    @Override
    public void add(Object data) {
        Node newNode = new Node(data);
        if (root == null){
            root = newNode;
        }else {
            root.addNode(newNode);
        }
        count++;
    }

    @Override
    public void print() {
        if (root == null){
            System.out.println("null");
        }else {
            root.printNode();
        }
    }

    @Override
    public int size() {
        return count;
    }

    @Override
    public boolean isEmpty() {
        return root==null;
    }

    @Override
    public boolean contains(Object data) {
        if (root == null){
            return false;
        }else {
            return root.containsNode(data);
        }
    }

    @Override
    public Object get(int index) {
        if (index > count-1 || index < 0){
            return null;
        }else {
            foot = 0;
            return root.getNode(index);
        }
    }

    @Override
    public void set(int index, Object data) {
        if (index > count-1 || index < 0){
            return;
        }else {
            foot = 0;
            root.setNode(index,data);
        }
    }

    @Override
    public void remove(Object data) {
        if (root == null) {
            return;
        }else if (root.data.equals(data)){
            root=root.next;
        }else if (root.next == null){
            return;
        }else {
            root.next.removeNode(root,data);
        }
    }
}

测试：
 

public class Main {

    public static void main(String[] args) {

        LinkImo1 linkImo1 = new LinkImo1();
        linkImo1.add("A");
        linkImo1.add("B");
        linkImo1.add("C");
        linkImo1.set(0,"E");
        linkImo1.set(2,"L");
        linkImo1.get(2);
        System.out.println();
        linkImo1.remove("L");
        System.out.println(linkImo1.get(0));
        System.out.println(linkImo1.get(2));
    }
}