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

返回节点为链表长度-k+1

import java.util.*;

/*
 * public class ListNode {
 *   int val;
 *   ListNode next = null;
 *   public ListNode(int val) {
 *     this.val = val;
 *   }
 * }
 */

public class Solution {
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     *
     * @param pHead ListNode类
     * @param k int整型
     * @return ListNode类
     */
    public ListNode FindKthToTail (ListNode pHead, int k) {
        int length = 0;
        ListNode res = pHead;
        while (res != null) {
            length++;
            res = res.next;
        }
        if (length < k) {
            return null;
        } else {
            for (int i = 1; i < length - k + 1; i++) {
                pHead = pHead.next;
            }

            return pHead;
        }
    }
}