剑指 Offer 22. 链表中倒数第k个节点
环形队列,顺序查找
(还可以使用双指针进一步优化内存)
public class SolutionJz22 {
public class ListNode {
int val;
ListNode next;
ListNode(int x) { val = x; }
}
public ListNode getKthFromEnd(ListNode head, int k) {
ListNode temp = head;
Object[] objectArrayList = new Object[k + 1];
int i = 0;
while (temp != null) {
objectArrayList[i % k] = temp;
temp = temp.next;
i++;
}
return (ListNode)objectArrayList[(i - 1) % k];
}
}