/**
- 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 fnode = head;
ListNode snode = head;
//快慢指针,先让快的走k-1步
for(int i = 0;i<k-1;i++){
fnode = fnode.next;
}
//然后一块走,直到快的走到最后一步
while(fnode.next!=null){
snode = snode.next;
fnode = fnode.next;
}
return snode.val;
}
}