1.定义链表节点类:
class ListNode: def init(self, val=0, next=None): self.val = val self.next = next
2.找到链表中最后一个节点:
def print_last_node(head): # 如果链表为空,返回空值 if not head: return None # 遍历链表,找到最后一个节点 while head.next: head = head.next # 返回最后一个节点的值 return head.val
3.测试:
if name == 'main': # 创建链表 n1 = ListNode(1) n2 = ListNode(2) n3 = ListNode(3) n4 = ListNode(4) n5 = ListNode(5) n1.next = n2 n2.next = n3 n3.next = n4 n4.next = n5 # 打印最后一个节点的值 print(print_last_node(n1))
输出结果为: 5