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

import java.util.Scanner;

// 注意类名必须为 Main, 不要有任何 package xxx 信息
public class Main {
 public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        in.useDelimiter("\n");
        // 注意 hasNext 和 hasNextLine 的区别
        while (in.hasNext()) { // 注意 while 处理多个 case
            int length = in.nextInt();
            String data = in.next();

            String[] split = data.split(" ");
            ListNode pNode = new ListNode();
            ListNode head = new ListNode();

            for(int i = split.length - 1; i >= 0; i --) {
                if(i != split.length - 1) {
                    pNode = pNode.m_pNext;
                }
                ListNode node = new ListNode();
                node.m_nKey = Integer.parseInt(split[i]);
                pNode.m_pNext = node;
                if(i == split.length - 1) {
                    head.m_pNext = node;
                }
            }
            int no = in.nextInt();

            for(int i = 1; i <= no; i ++) {
                head = head.m_pNext;
            }
            System.out.println(head.m_nKey);

        }
    }

    static class ListNode {
        int m_nKey;
        ListNode m_pNext;
    };
}