带头单链表

定义一个接口ICLinked

public interface ICLinked {
        //头插法
        void addFirst(int data);
        //尾插法
        void addLast(int data);
        //任意位置插入,第一个数据节点为0号下标
        boolean addindex(int index,int data);
        //查找是否包含关键字key是否在单链表当中
        boolean contains(int key);
        //删除第一次出现关键字为key的节点
        int remove(int key);
        //删除所有值为key的节点
        void removeAllKey(int key);
        //得到单链表的长度
        int getLength();
        void display();
        void clear();
}

定义一个HeadSingleListlmpl类实现ICLinked接口

public class HeadSingleListlmpl implements ICLinked {
    //节点类
    class Node{
        private int data;
        private Node next;
        //头节点
        public Node() {
            this.data = -1;

        }
        //数据节点
        public Node(int data){
            this.data=data;
        }
    }
    private Node head;
    public HeadSingleListlmpl(){
        this.head=new Node();
        this.head.next=this.head;
    }
    @Override
    public void addFirst(int data) {
        Node node =new Node(data);
        node.next=this.head.next;
        this.head.next=node;
    }

    @Override
    public void addLast(int data) {
        Node cur=this.head;
        while (cur.next!=this.head){
            cur=cur.next;
        }
        Node node=new Node(data);
        node.next=cur.next;
        cur.next=node;
    }

    private Node searchIndex(int index){
        checkIndex(index);
        Node cur =this.head;
        for (int i = 0; i <index; i++) {
            cur=cur.next;
        }
        return cur;
    }

    private void checkIndex(int index){
        if (index<0||index>getLength()){
            throw new UnsupportedOperationException("index不合法");
        }
    }
    @Override
    public boolean addindex(int index, int data) {
        Node pre=searchIndex(index);
        Node node=new Node(data);
        node.next=pre.next;
        pre.next=node;
        return true;
    }

    @Override
    public boolean contains(int key) {
        Node cur=this.head.next;
        while (cur!=this.head){
            if (cur.data== key){
                return true;
            }
            cur=cur.next;
        }
        return false;
    }
   //若果找不到返回空
    private Node searchPre(int key){
        Node pre=this.head;
        while (pre.next!=this.head){
            if (pre.next.data==key){
                return pre;
            }
            pre=pre.next;
        }
        return null;
    }
    @Override
    public int remove(int key) {
        Node pre =searchPre(key);
        if (pre==null){
            throw new UnsupportedOperationException("没有key这个关键字");
        }
        Node del=pre.next;
        int oldData=del.data;
        pre.next=del.next;
        return oldData;
    }

    @Override
    public void removeAllKey(int key) {
        Node cur=this.head.next;
        Node pre=this.head;
        while (cur!=this.head){
            if (cur.data==key){
                pre.next=cur.next;
                cur=cur.next;
            }else {
                pre=cur;
                cur=cur.next;
            }
        }
    }
    @Override
    public int getLength() {
        int count=0;
        //cur指向第一个数据节点
        Node cur =this.head.next;
        while (cur!=this.head){
            count++;
            cur=cur.next;
        }
        return count;
    }

    @Override
    public void display() {
        Node cur =this.head.next;
        while (cur!=this.head){
            System.out.print(cur.data+" ");
            cur=cur.next;
        }
        System.out.println();
    }

    @Override
    public void clear() {
        //防止内存泄漏
        while (this.head.next!=this.head){
            Node cur=this.head.next;
            this.head.next=cur.next;
        }
        //头节点置空
        this.head=null;
    }
}

测试类

public class TestDemo1 {
    public static void main(String[] args) {
        HeadSingleListlmpl headSingleListlmpl=new HeadSingleListlmpl();
        headSingleListlmpl.addFirst(10);
        headSingleListlmpl.addFirst(20);
        headSingleListlmpl.addFirst(30);
        headSingleListlmpl.addFirst(40);
        headSingleListlmpl.display();
        headSingleListlmpl.addLast(20);
        headSingleListlmpl.addLast(77);
        headSingleListlmpl.addLast(88);
        headSingleListlmpl.addLast(99);
        headSingleListlmpl.display();
        headSingleListlmpl.clear();
//        headSingleListlmpl.addindex(0,77);
//        headSingleListlmpl.display();
//        headSingleListlmpl.addindex(9,67);
//        headSingleListlmpl.display();
//        headSingleListlmpl.addindex(4,97);
//        headSingleListlmpl.display();
//        System.out.println(headSingleListlmpl.contains(67));
//        System.out.println(headSingleListlmpl.contains(167));
//        System.out.println(headSingleListlmpl.remove(97));
//        headSingleListlmpl.display();
//        System.out.println(headSingleListlmpl.remove(77));
//        headSingleListlmpl.display();
//        headSingleListlmpl.removeAllKey(20);
//        headSingleListlmpl.display();
    }
}