目录
简介
题目
题解
简介
链表
题目
题解
class Solution {
public ListNode getKthFromEnd(ListNode head, int k) {
ListNode front = head;
ListNode behind = head;
while(front!=null && k>0){
front = front.next;
k--;
}
while(front!=null){
front = front.next;
behind = behind.next;
}
return mid;
}
}