如何删除给定单向链表的倒数第N个元素

public class DeleteNElementFromBottom {
    static Node deleteNElementFromBottom(Node head, int n) {
        Node quickNode = head;
        Node slowNode = null;
        int count = 0;
        while (quickNode != null) {
            if (slowNode == null && count == n) {
                // 快指针已经移动过N个元素之后,慢指针才会指向链表头元素
                slowNode = head;
            } else if (slowNode != null) {
                // 慢指针后移
                slowNode = slowNode.next;
            }
            // 快指针后移
            quickNode = quickNode.next;
            // 计数,用于判断慢指针开始指向头元素时机
            // 以及,链表边界值问题
            count++;
            if (quickNode == null) {
                break;
            }
        }
        if (count == n) {
            // 删除元素正好是边界值时,返回链表第二个元素做为新链表首元素
            return head.next;
        } else {
            if (null != slowNode) {
                // 将被删除的指定元素后一元素接到前一元素上
                slowNode.next = slowNode.next.next;
            }
            return head;
        }
    }
 
    public static void main(String[] args) {
        Node node1 = new Node(1);
        Node node2 = new Node(2);
        Node node3 = new Node(3);
        Node node4 = new Node(4);
        Node node5 = new Node(5);
        node1.next = node2;
        node2.next = node3;
        node3.next = node4;
        node4.next = node5;
        System.out.println(print(node1));
        Node backward = deleteNElementFromBottom(node1, 2);
        System.out.println(backward);
    }
 
    static String print(Node head) {
        StringBuilder sb = new StringBuilder("Head->");
        Node p = head;
        while (p != null) {
            sb.append(p.data).append("->");
            p = p.next;
        }
        sb.append("null");
        return sb.toString();
    }
    static class Node {
        int data;
        Node next;
        public Node(int data) {
            this.data = data;
        }
        @Override
        public String toString() {
            return "Node{data=" + data + ", next=" + next + '}';
        }
    }
}