代码随想录 -- 链表 -- 反转链表

206. 反转链表 - 力扣（LeetCode）

一开始采用直接创建一个新链表的方法：

class Solution(object):
    def reverseList(self, head):
        """
        :type head: ListNode
        :rtype: ListNode
        """
        resHead = ListNode()
        while head:
            temp = ListNode(head.val,resHead.next)
            resHead.next = temp
            head = head.next
        return resHead.next

看题解采用双指针法：

pre 指针指向 current 指针的前一个元素，先用 temp 指针记录 current.next，再将 current.next 指向 pre，然后令 pre = current，最后令 current = temp

# 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
        """
        pre = None
        current = head
        while current:
            temp = current.next
            current.next = pre
            pre = current
            current = temp
        return pre