单向链表反转
链表时间复杂度:
Insert O(1)
Delete O (1)
search O(n )
单向链表反转
class Solution:
def __init__(self, elem, next_=None):
self.var = elem
self.next = next_
def reverseList(head):
cur = head
pre = None
while cur:
tmp = cur.ne
原创
2021-04-10 15:11:41 ·
54 阅读 ·
0 评论