代码

import sysclass ListNode:def __init__(self, x):self.val = xself.next = None# 将列表转换成链表
def list_to_listnode(numbers):dummy_root = ListNode(0)ptr = dummy_rootfor number in numbers:ptr.next = ListNode(number)ptr = ptr.nextptr = dummy_root.nextreturn ptr# 遍历链表
def travel_listnode(head):res = headwhile res is not None:print(res.val)res = res.nextdef main():line = sys.stdin.readline().strip()values = list(map(int, line.split()))head = list_to_listnode(values)travel_listnode(head)if __name__ == '__main__':main()

输入输出

input:
21 34 45 656 output:
21
34
45
656

练习

LeetCode19. Remove Nth Node From End of List 删除链表中的倒数第n个位置的元素