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

import java.util.Scanner;

// 注意类名必须为 Main, 不要有任何 package xxx 信息
public class Main {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        sysList((in));
    }

    private static void sysList(Scanner in) {
        
        // 注意 hasNext 和 hasNextLine 的区别
        while (in.hasNextInt()) { // 注意 while 处理多个 case
        int n = in.nextInt();
        ListNode header = new ListNode(in.nextInt());
        ListNode tail = header;
            for (int i = 0; i < n - 1; i++) {
                int val = in.nextInt();
                tail.next = new ListNode(val);
                tail = tail.next;

            }
            int k = in.nextInt();
            int num1 = num(header);
            for (int i = 0; i < num1 - k + 1; i++) {
                header = header.next;
            }
            System.out.println(header.val);
		  //多组输入时递归
            sysList(in);
        }
    }
    private static int num(ListNode h) {
        int num1 = 0;
        while (h.next != null) {
            num1++;
            h = h.next;
        }
        return num1;
    }
}
class ListNode {
    int val;
    ListNode next = null;

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