迭代法 / 双指针法
# 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
"""
cur = head
prev = None
while(cur != None):
temp = cur.next
cur.next = prev
prev = cur
cur = temp
return prev
递归法:不会