题目
给你单链表的头节点 head ,请你反转链表,并返回反转后的链表。
示例 1:
输入:head = [1,2,3,4,5]
输出:[5,4,3,2,1]
示例 2:
输入:head = [1,2]
输出:[2,1]
示例 3:
输入:head = []
输出:[]
提示:
链表中节点的数目范围是 [0, 5000]
-5000 <= Node.val <= 5000
进阶:链表可以选用迭代或递归方式完成反转。你能否用两种方法解决这道题?
解题
迭代法,高级版。边迭代访问边进行反转。空间复杂度为O(n)。
# Definition for singly-linked list.
# class ListNode(object):
# def __init__(self, val=0, next=None):
# self.val = val
# self.next = next
class Solution(object):
def reverseList(self, head):
"""
:type head: ListNode
:rtype: ListNode
"""
if head == None or head.next == None:
return head
node = head
node_next = node.next
node_head = node_next.next
node.next = None
node_next.next = node
node = node_next
while node_head != None:
node_next = node_head
node_head = node_next.next
node_next.next = node
node = node_next
return node
递归法
class Solution(object):
def reverseList(self, head):
"""
:type head: ListNode
:rtype: ListNode
"""
if head == None or head.next == None:
return head
node_next = self.reverseList(head.next)
head.next.next = head
head.next = None
return node_next
要点:递归返回的是头部链表,要循环到尾部;或者如上述代码,head.next实际就是尾部节点。