链表中倒数第K个节点

/*
public class ListNode {
    int val;
    ListNode next = null;

    ListNode(int val) {
        this.val = val;
    }
}*/
public class Solution {
    public ListNode FindKthToTail(ListNode head,int k) {
        ListNode p = head;
        ListNode q = head;
        int count = 0;
        for(;p != null;p = p.next,count++)
        {
            if(count >=k)
            {
                q = q.next;
            }
        }
        return k>count?null:q;
    }
}