具体见下面代码
# 定义结点类 class LNode(object): def __init__(self, elem, next_=None): self.elem = elem self.next = next_ # 定义链表类 class LList(object): def __init__(self): self.head = None # 链表头部加结点 def prepend(self, elem):
# 头部添加结点,而且使加入的结点指向先前的结点 self.head = LNode(elem, self.head) def printall(self): # 遍历链表 p = self.head while p is not None: print(p.elem, end='') if p.next is not None: print(', ', end='') p = p.next print('') def rev(self): # 反转链表(迭代法) pre = None while self.head is not None: q = self.head self.head = q.next # 摘下原来的结点 q.next = pre # 确定链接关系 pre = q # 将刚摘下来的结点加入pre引用的结点序列 self.head = pre # 反转后的结点序列已经做好,重置表头链接 llist = LList() for i in range(10): llist.prepend(i) llist.printall() llist.rev() llist.printall()
输出结果为;