剑指 Offer 22. 链表中倒数第k个节点
说明
输入一个链表,输出该链表中倒数第k个节点。为了符合大多数人的习惯,本题从1开始计数,即链表的尾节点是倒数第1个节点。例如,一个链表有6个节点,从头节点开始,它们的值依次是1、2、3、4、5、6。这个链表的倒数第3个节点是值为4的节点。
示例
给定一个链表: 1->2->3->4->5, 和 k = 2.
返回链表 4->5.
题解思路
1、将链表存入数组,取出后k个数,再以链表输出
2、双指针实现
代码实现
方法一:
# Definition for singly-linked list.
# class ListNode:
# def __init__(self, x):
# self.val = x
# self.next = None
class Solution:
def getKthFromEnd(self, head: ListNode, k: int) -> ListNode:
temp = []
while head:
temp.append(head.val)
head = head.next
anslist = temp[-k:]
ans = ListNode(anslist[0])
node = ans
for i in range(1, len(anslist)):
temp = ListNode(anslist[i])
node.next = temp
node = temp
return ans
方法二:
# Definition for singly-linked list.
# class ListNode:
# def __init__(self, x):
# self.val = x
# self.next = None
class Solution:
def getKthFromEnd(self, head: ListNode, k: int) -> ListNode:
last = head
first = head
for i in range(k):
first = first.next
while first:
last = last.next
first = first.next
return last