【数据结构】双向链表的实现

双向链表的基本操作的实现
（与单向链表相比，在此基础上多加了一个前驱结点）

class Node {
   
    int val;
    Node next = null;   // 指向后继结点，最后一个结点的 next == null
    Node prev = null;   // 指向前驱结点，第一个结点的 prev == null

    Node(int val) {
   
        this.val = val;
    }
}
public class MyLinkedList {
   
    private Node head = null;
    private Node last = null;
    private int size = 0;

    public void pushFront(int val) {
   
        Node node = new Node(val);
        node.next = head;
        if (head != null) {
   
            head.prev = node;
        } else {
   
            last = node;
        }
        head = node;

        size++;
    }

    public void popFront() {
   
        if (size <= 0) {
   
            System.out.println("无法对空链表做删除");
            return;
        }

        head = head.next;
        if (head != null) {
   
            head.prev = null;
        } else {
   
            last = null;
        }
        size--;
    }

    void pushBack(int val) {
   
        Node node = new Node(val)