这题以前做过,但是第一次过都是用的死方法
public class Solution {public ListNode FindKthToTail(ListNode head,int k) {ListNode listNode = head;int len = 0;while(listNode!=null) {len ++;listNode = listNode.next;}listNode = head;if (len < k) {return null;}else if(len == k) {return head;}len = 0;while(len < k) {len ++;listNode = listNode.next;}while(listNode!=null) {head = head.next;listNode = listNode.next;}return head;}
}










