剑指 Offer 22. 链表中倒数第k个节点

class Solution {
    public ListNode getKthFromEnd(ListNode head, int k) {
        ListNode first = head;
        for (int i = 0; i < k; i++) {
            first = first.next;
        }

        ListNode second = head;
        while (first != null) {
            first = first.next;
            second = second.next;
        }

        return second;
    }
}

Reference

剑指 Offer 22. 链表中倒数第k个节点