牛客网-剑指offer[编程题]链表中倒数第k个结点 js详解

1.循环寻找法
先循环一遍链表找到链表长度，获得要求节点的顺序排位，再顺着找要求的节点

/*function ListNode(x){
    this.val = x;
    this.next = null;
}*/
function FindKthToTail(head, k)
{
   var x = head；
   var count = 1;
    while(x){
        x = x.next
        count++;
    }
    var time = count - k;
    count = 0;
    x = head;
     while(x){
       if(count === k)
        return x.val;
        x = x.next
        count++;
    }
}

2.快慢指针法
快指针先往前走k步，注意判断边界，然后快慢一起走，当快指针为none的时候，慢指针走到了倒数第k个节点

/*function ListNode(x){
    this.val = x;
    this.next = null;
}*/
function FindKthToTail(head, k){
    var p = head;
    var q = head;
for(var i = 0;i < k;i++){
    if(p)
    p = p.next;
    else
       return 0;
}
while(p){
     p = p.next;
     q = q.next;
}
     return q;
}