题目链接:https://leetcode-cn.com/problems/kth-node-from-end-of-list-lcci/
题目如下:
/**
* 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) {
ArrayList<Integer> array=new ArrayList<Integer>();
while(head!=null){
array.add(head.val);
head=head.next;
}
return array.get(array.size()-k);
}
}