双向链表的实现及简单操作

双向链表的实现以及简单操作

• 节点类

class ListNode{
    private int val;
    private ListNode prev;
    private ListNode next;
        public ListNode(int val) {
        this.val = val;
    }

    public int getVal() {
        return val;
    }

    public void setVal(int val) {
        this.val = val;
    }

    public ListNode getPrev() {
        return prev;
    }

    public void setPrev(ListNode prev) {
        this.prev = prev;
    }

    public ListNode getNext() {
        return next;
    }

    public void setNext(ListNode next) {
        this.next = next;
    }
}

• 头插法

    private ListNode head;
    private ListNode last;
    //头插法
    public void addFirst(int data){
        ListNode node = new ListNode(data);
        if(this.head == null){
            this.head = node;
            this.last = node;
        }else{
            //node.next = this.head;
            node.setNext(this.head);
            this.head.setPrev(node);
           this.head = node;
        }
    }

• 尾插法

//尾插法
    public void addLast(int data){
        ListNode node = new ListNode(data);
        if(this.head == null){
            this.head = node;
            this.last = node;
        }else{
           // last.next = node;
            last.setNext(node);
            //node.prev = last;
            node.setPrev(last);
            last = node;
        }

    }

• 任意位置插入,第一个数据节点为0号下标

//任意位置插入,第一个数据节点为0号下标
    public void addIndex(int index,int data){
        if(index < 0 || index > size()){
            return;
        }
        if(index == 0){
            addFirst(data);
            return;
        }
        if(index == size()){
            addLast(data);
            return;
        }
        ListNode cur = this.head;
        while (index != 0){
            //cur = cur.next;
            cur = cur.getNext();
            index--;
        }
        ListNode node = new ListNode(data);
        //node.next = cur;
        node.setNext(cur);
        //node.prev = cur.prev;
        node.setPrev(cur.getPrev());
        //node.prev.next = node;
        node.getPrev().setNext(node);
        //cur.prev = node;
        cur.setPrev(node);


    }

• 得到单链表的长度

 //得到单链表的长度
    public int size(){
        ListNode cur = this.head;
        int count = 0;
        while (cur != null){
            count++;
            cur = cur.getNext();

        }
        return count;
    }

• 查找是否包含关键字key是否在单链表当中

//查找是否包含关键字key是否在单链表当中
    public boolean contains(int key){
        ListNode cur = this.head;
        while(cur != null){
           if(cur.getVal() == key){
               return true;
           }
            cur = cur.getNext();
        }
        return false;
    }

• 删除第一次出现关键字为key的节点

//找到需要删除的节点
    public ListNode findNode(int key){
        ListNode cur = this.head;
        while (cur != null){
            if(cur.getVal() == key){
                return cur;
            }
        }
        return null;
    }
    //删除第一次出现关键字为key的节点
    public void remove(int key){
        ListNode cur = findNode(key);
        if(cur == null){
            return;
        }
        if(cur == this.head){
            this.head = this.head.getNext();
            this.head.setPrev(null);
            return;
        }
        if(cur == this.last){
            cur.getPrev().setNext(null);
            this.last = this.last.getPrev();
            return;
        }
        cur.getPrev().setNext(cur.getNext());
        cur.getNext().setPrev(cur.getPrev());
    }

• 删除所有值为key的节点

//删除所有值为key的节点
    public void removeAllKey(int key){
        ListNode cur = this.head;
        while (cur != null){
            if(cur.getVal() == key){
                if(cur == this.head){
                    //头节点
                    this.head = this.head.getNext();
                    this.head.setPrev(null);
                }else {
                    cur.getPrev().setNext(cur.getNext());
                    if(cur.getNext() != null){
                        cur.getNext().setPrev(cur.getPrev());
                    }else {
                        //cur.next == null
                        this.last = this.last.getPrev();

                    }
                }
            }
            cur = cur.getNext();
        }
    }

• 清空链表

//清空链表
    public void clear(){
        this.head = null;
        this.last = null;
    }