15、链表中倒数第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) {if(head == null) return head;        ListNode h = new ListNode(0);        h.next = head;        ListNode slow = h, fast = h;        int count = k;        while(k-- > 0 && fast.next != null){fast = fast.next;        }        if(k != -1) return null;        while(fast.next != null){slow = slow.next;            fast = fast.next;        }        return slow.next;    }}