题解 | #链表中倒数最后k个结点#

public class Solution {

    public ListNode FindKthToTail(ListNode pHead, int k) {
        if (pHead==null){
            return null;
        }
        int[] kval = {k};
        ListNode node = null;
        ListNode result = recursion(pHead, kval);
        
        return result;
    }

    public ListNode recursion(ListNode pHead, int[] k) {
        if (pHead.next == null) {
            return null;
        }

      ListNode node = recursion(pHead.next, k);
        k[0]= k[0]-1;
        if (k[0] == 1) {
            node = pHead;
        }
        return node;
    }
}