class LinNode:
def __init__(self, val):
self.val = val
self.next = None
def LinReverse(l):
h1 = l
h2 = l.next
h1.next = None
h3 = None
while h2:
h3 = h2.next
h2.next = h1
h1 = h2
h2 = h3
return h1
python 链表逆转
最新推荐文章于 2021-06-13 18:47:33 发布