输入一个链表,输出该链表中倒数第k个节点。为了符合大多数人的习惯,本题从1开始计数,即链表的尾节点是倒数第1个节点。
例如,一个链表有 6 个节点,从头节点开始,它们的值依次是 1、2、3、4、5、6。这个链表的倒数第 3 个节点是值为 4 的节点。
解题思路:先遍历一遍链表,获得链表长度,再做下一步运算
# 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:
p,length = head,0
while p != None:
length += 1
p = p.next
p = head
length = length-k
while length > 0:
p = p.next
length -= 1
return p
经典解题思路:快慢指针,即先冻结慢指针k步,在快指针走了k步之后,两者再一起走。
# 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:
p= head
while p!= None:
p = p.next
if(k == 0):
head = head.next
else:
k-=1
return head