面试题 02.02. 返回倒数第 k 个节点 – 力扣（LeetCode）
/**
* Definition for singly-linked list.
* function ListNode(val, next) {
* this.val = (val===undefined ? 0 : val)
* this.next = (next===undefined ? null : next)
* }
*/
/**
* @param {ListNode} head
* @param {number} k
* @return {number}
*/
var kthToLast = function(head, k) {
let fast = head, slow = head;
for(let i = 0; i < k; i++){
fast = fast.next
}
while(fast){
fast = fast.next
slow = slow.next
}
return slow.val
};
原创文章，作者：czhdawn，如若转载，请注明出处：https://www.czhdawn.cn/archives/4967
