居安思危

何解?
1、假如有1、2、3三个节点,找倒数第二个,实际是整数第几个? 3-2+1 = 2 : 及 length - k + 1 ,所以先遍历找节点长度,在遍历找所需节点
var findNode = function(head , k){
let length = 0 , prev = head
while(prev){
length++
prev = prev.next
}
prev = head
let num = length - k + 1
while(num > 1){
num--
prev = prev.next
}
return prev
}
2、快慢指针法,让快指针先移动k-1步,在快慢同时遍历,当快指针走到尾时,慢指针也就指在了所需节点
var findNode = function(head , k){
let fast = head , slow = head ,num = k-1
while(num > 0){
num--
fast = fast.next
}
while(fast.next !== null){
fast = fast.next
slow = slow.next
}
return slow
}