java-双链表

class Node {
    public int data;
    public Node prev;//前驱信息
    public Node next;//后继信息

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

public class MyLinkedList {
    public Node head;
    public Node tail;//尾巴
    //1.头插法
    public void addFirst(int data) {
        Node node = new Node(data);
        if (this.head == null) {
            this.head = node;
            this.tail = node;
        } else {
            node.next = head;
            this.head.prev = node;
            this.head = node;
        }
    }

    //2.打印
    public void display(){
       Node cur = this.head;
       while(cur != null) {
           System.out.print(cur.data+" ");
           cur = cur.next;
       }
        System.out.println();
    }

    //3.尾插法
    public void addLast(int data){
        Node node = new Node(data);
        if(this.head == null){
            this.head = node;
            this.tail = node;
        }
        else{
            this.tail.next = node;
            node.prev = this.tail;
            this.tail = this.tail.next;
        }
    }

    //4.查找是否包含关键字key在双链表中
    public boolean contains(int key) {
        Node cur = this.head;
        while(cur != null) {
            if (cur.data == key) {
                return true;
            }
            cur = cur.next;
        }
        return false;
    }

    //5.得到双链表的长度
    public int size() {
        int count = 0;
        Node cur = this.head;
        while(cur != null) {
            count++;
            cur = cur.next;
        }
        return count;
    }

    //6.任意index位置插入data
    //判断index的合法性
    private void checkIndex(int index) {
        if (index < 0 || index > size()) {
            throw new RuntimeException("index不合法！");
        }
    }
    //找出index的位置
    private Node searchIndex(int index) {
        Node cur = this.head;
        while(index != 0) {
            cur = cur.next;
            index--;
        }
        return cur;
    }

    //任意位置插入，第一个数据节点为index下标
    public void addIndex(int index,int data) {
        checkIndex(index);
        Node cur = searchIndex(index);
        Node node = new Node(data);
        //如果是第一次插入-头插法
        if (index == 0) {
            addFirst(data);
            return;
        }
        //尾插
        if (index == size()) {
            addLast(data);
            return;
        }

        //中间位置插入,四个位置
            node.next = cur;
            node.prev = cur.prev;
            cur.prev.next = node;
            cur.prev = node;
    }

    //7.删除第一次出现的关键字key的节点
    public int remove(int key) {
          Node cur = this.head;
          while(cur != null) {
              if (cur.data == key) {
                  int oldData = cur.data;
                  if (cur == this.head) {
                      this.head = this.head.next;
                      this.head.prev = null;
                  }
                  else {
                      cur.prev.next = cur.next;
                      if (cur.next != null) {
                          cur.next.prev = cur.prev;
                      } else {
                          //删除的是尾巴节点，只需移动tail
                          this.tail = cur.prev;
                      }
                  }
                  return oldData;
              }
                  cur = cur.next;
          }
          return -1;
    }


    //8.删除所有值为key的节点
    public int allremove(int key) {
        Node cur = this.head;
        while(cur != null) {
            if (cur.data == key) {
                if (cur == this.head) {
                    this.head = this.head.next;
                    if (this.head != null) {
                        this.head.prev = null;
                    }
                }
                else {
                    cur.prev.next = cur.next;
                    if (cur.next != null) {
                        cur.next.prev = cur.prev;
                    } else {
                        //删除的是尾巴节点，只需移动tail
                        this.tail = cur.prev;
                    }
                }
            }
            cur = cur.next;
        }
        return -1;
    }

    //9.清除-一个一个节点释放
    public void clear(){
        while(this.head != null) {
            Node cur = this.head.next;
            this.head.prev = null;
            this.head.next = null;
            this.head = cur;
        }
        this.tail = null;
    }
}