LeetCode 206 - 反转链表

题目描述
反转一个单链表。
示例:
输入: 1->2->3->4->5->NULL
输出: 5->4->3->2->1->NULL

解法一：递归（Python）

解法一和解法二的详细解释内容参考： 动画演示+多种解法 206. 反转链表

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

class Solution:
    def reverseList(self, head: ListNode) -> ListNode:
        if(head == None or head.next == None):
            return head
        cur = self.reverseList(head.next)
        head.next.next = head
        head.next = None
        return cur

解法二：双指针迭代（Python）

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

class Solution:
    def reverseList(self, head: ListNode) -> ListNode:
        pre = None
        cur = head 
        while cur:
            tmp = cur.next 
            cur.next = pre
            pre = cur 
            cur = tmp
        return pre