输入一个链表输出该链表中倒数第k个结点。public class Solution { public ListNode FindKthToTail(ListNode head,int k) { ListNode quickhead; ListNode slowhead; if(k0){ return null; } for(int i0;ik-1;i){ quickquick.next; } while(quick.next!null){ quickquick.next; slowslow.next; } return slow; } }