面试0202 返回链表倒数第k个节点
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
class Solution {
public int kthToLast(ListNode head, int k) {
ListNode p = head;
for (int i = 1; i <= k; i++)
p = p.next;
ListNode q = head;
while (p != null) {
p = p.next;
q = q.next;
}
return q.val;
}
}