剑指 Offer 22. 链表中倒数第k个节点

最新推荐文章于 2024-06-16 00:05:12 发布

元宇宙MetaAI

最新推荐文章于 2024-06-16 00:05:12 发布

阅读量54

点赞数

文章标签：链表数据结构

本文链接：https://blog.csdn.net/CSS360/article/details/131500137

版权

剑指 Offer 22. 链表中倒数第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:
        if head is None:
            return head
        first, last = head, head
        while k > 0:
            if last is None:
                return None
            last = last.next
            k -= 1
        while last:
            first = first.next
            last = last.next
        return first