以下是所有算法汇总，包括GitHub源码地址链接：力扣算法练习汇总（持续更新…）
1、
2、
/**
* 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) {
// 1. node size
int nodeCount = 0;
ListNode temp = head;
while (temp != null) {
nodeCount++;
temp = temp.next;
}
// 2. target node position
int position = nodeCount - k + 1;
temp = head;
nodeCount = 0;
while (temp != null) {
nodeCount++;
if (nodeCount == position) {
return temp;
}
temp = temp.next;
}
return null;
}
}