206. Reverse Linked List

最新推荐文章于 2022-08-03 07:58:37 发布

caisense

最新推荐文章于 2022-08-03 07:58:37 发布

阅读量87

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/u012033124/article/details/81017693

版权

LeetCode 专栏收录该内容

195 篇文章 0 订阅

订阅专栏

https://leetcode.com/problems/reverse-linked-list/description/
反转链表
思路：头插法。类似：92. Reverse Linked List II

# Definition for singly-linked list.
# class ListNode:
#     def __init__(self, x):
#         self.val = x
#         self.next = None

class Solution:
    def reverseList(self, head):
        """
        :type head: ListNode
        :rtype: ListNode
        """
        if not head:  #排除极端情况
            return head
        Head = ListNode(0)  #辅助头结点
        Head.next = head
        pre, cur = Head, head
        while cur.next:  #头插法
            move = cur.next
            cur.next = move.next
            move.next = pre.next
            pre.next = move
        return Head.next