实现一个算法,找出单向链表中倒数第k个节点
class Node():
def __init__(self,val):
self.val = val
self.next = None
class LinkList:
def __init__(self):
self.head = Node(Node)
实现一个算法,找出单向链表中倒数第k个节点
class Node():
def __init__(self,val):
self.val = val
self.next = None
class LinkList:
def __init__(self):
self.head = Node(Node)