classSolution:defgetKthFromEnd(self, head: ListNode, k:int)-> ListNode:
p = head
for i inrange(k):
p = p.next
q = head
while p:
p = p.next
q = q.nextreturn q
题目【剑指offer】022.链表中倒数第k个节点解法双指针class Solution: def getKthFromEnd(self, head: ListNode, k: int) -> ListNode: p = head for i in range(k): p = p.next q = head while p: p = p.next q