输入一个链表，输出该链表中倒数第K个节点

在这里插入代码片在这里插入代码片/*
public class ListNode {
    int val;
    ListNode next = null;

    ListNode(int val) {
        this.val = val;
    }
}*/
public class Solution {
    private int getSize(ListNode head){
        int size =0;
        for(ListNode cur = head; cur != null;cur = cur.next){
            size ++;
        }
        return size;
    }
    public ListNode FindKthToTail(ListNode head,int k) {
       if(head == null){
           return null;
       }
        //需要保证K的值有效
        int size = getSize(head);
        if(k <= 0 || k > size){
            return null;
        }
        //引用走的步数
        int offset = size - k;
        ListNode cur = head;
        for(int i = 0;i < offset; i++){
            cur = cur.next;
        }
        return cur;
    }
}