LinkedList:找出链表倒数第k个结点

public static Node test1(Node node,int k) {
        int nodeCount = 0;
        Node headNode = node;
        while (node != null) {
            nodeCount++;
            node = node.next;
        }
        
        int index = nodeCount - k;
        for (int i = 0; i < index; i++) {
            headNode = headNode.next;
            
        }
        return headNode;
    }