206. Reverse Linked List
Reverse a singly linked list.
- 递归法:将链表的下一个的指针指向其上一个
- 迭代法:采用双指针,一个指针指向其上一个的地址,将链表的下一个指针指向上一个指针
# class ListNode(object):
# def __init__(self, x):
# self.val = x
# self.next = None
class Solution(object):
def reverseList(self, head):
"""
:type head: ListNode
:rtype: ListNode
"""
per = None
while head:
nex = head.next
head.next = per
per = head
head = nex
return per