【剑指OFFER】链表中倒数第k个结点

 1 /*
 2 public class ListNode {
 3     int val;
 4     ListNode next = null;
 5 
 6     ListNode(int val) {
 7         this.val = val;
 8     }
 9 }*/
10 public class Solution {
11     public ListNode FindKthToTail(ListNode head,int k) {
12         ListNode p, q;
13         p = q = head;
14         int i = 0;
15         for (;p != null; i++) {
16             if (i >= k) q = q.next;
17             p = p.next;
18         }
19         return i < k ? null : q;
20     }
21 }