链表中倒数第k个节点

输入一个链表，输出该链表中倒数第k个节点

class Listnode:
    def __init__(self,item):
        self.val=item
        self.next=None
class Solution:
    def findk(self,head,k):
        firstnode=head
        secondnode=head
        for i in range(k):
            if fistnode==None:
                return None
            firstnode=firstnode.next
        while firstnode!=None:
            firstnode=firsenode.next
            secondnode=second.next
        return secondnode.val

返回倒数第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:
        start=head
        end=head
        for i in range(k):
            end=end.next

        while end:
            start=start.next
            end=end.next
        return start