题解 | #输出单向链表中倒数第k个结点#

import java.util.*;

//初始化链表结构
class ListNode {
    int val;
    ListNode next;

    ListNode(int val) {
        this.val = val;
    }
}

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        while (scanner.hasNext()) {
            int length = scanner.nextInt();

            //根据输入值创建链表
            ListNode listNode = new ListNode(0);
            ListNode node = listNode;
            for (int i=0; i < length; i++) {
                ListNode next = new ListNode(scanner.nextInt());
                node.next = next;
                node = next;
            }

            //遍历链表，查找需要的节点数据
            int k = scanner.nextInt();
            ListNode outNode = listNode.next;
            for (int i=0; i < length-k; i++) {
                outNode = outNode.next;
            }

            System.out.println(outNode.val);
        }
    }
}