题目:
Java代码题解:
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
class Solution {
public ListNode getKthFromEnd(ListNode head, int k) {
if(head==null) return null;
//先求出列表的长度
int len=0;
ListNode k1=head;
while(k1!=null){
len++;
k1=k1.next;
}
//返回第n-k个元素
ListNode k2=head;
for(int i=1;i<=len-k;i++){
k2=k2.next;
}
return k2;
}
}