题目:力扣
给你单链表的头节点 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
解题思路:
置三个指针,分别代表前一个位置pre,当前位置cur和下一个位置fol,每次断开cur与fol中间的链接,使pre和cur换位置(cur.next = pre, pre = cur),再将cur->fol,fol->cur.next,再将cur与pre建立连接(cur.next = pre),循此往复,最终返回pre
代码:
# Definition for singly-linked list.
# class ListNode:
# def __init__(self, val=0, next=None):
# self.val = val
# self.next = next
class Solution:
def reverseList(self, head: ListNode) -> ListNode:
pre = None
cur = head
while cur:
fol = cur.next
cur.next = pre
pre = cur
cur = fol
return pre