逆序数据建立链表pta.zip

# 定义链表节点类 class ListNode: def __init__(self, val=0, next=None): self.val = val self.next = next # 从数组逆序创建链表 def reverseListFromArray(nums): # 初始化哑节点 dummy = ListNode(0) # 当前链表的尾节点初始化为哑节点 tail = dummy # 遍历数组的逆序，构建链表 for num in reversed(nums): # 创建新节点 newNode = ListNode(num) # 将新节点添加到链表的末尾 tail.next = newNode # 更新尾节点为新添加的节点 tail = newNode # 返回链表的头节点（哑节点的下一个节点） return dummy.next # 打印链表 def printList(head): current = head while current: print(current.val, end=" ") current = current.next print() # 换行 # 示例 nums = [1, 2, 3, 4, 5] head = reverseListFromArray(nums) # 打印链表 printList(head) # 应该输出: 5 4 3 2 1