实现一种算法,找出单向链表中倒数第 k 个节点。返回该节点的值。
方法一:使用LinkedList对象
package Algorithm;
import java.util.LinkedList;
public class kthToLast {
public class ListNode {
int val;
ListNode next;
ListNode(int x) { val = x; }
}
public int kthToLast(ListNode head, int k) {
LinkedList<Integer> list = new LinkedList<>();
while(head != null){
list.add(head.val);
head = head.next;
}
return list.get(list.size() - k);
}
}
方法二:使用快慢指针
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
class Solution {
public int kthToLast(ListNode head, int k) {
ListNode quick = head;
ListNode slow = head;
int i = 0;
while(quick != null){
if(i < k){
quick = quick.next;
i++;
continue;
}
quick = quick.next;
slow = slow.next;
}
return slow.val;
}
}