我采用的是每次迭代一个元素,然后一次拼接形成了 一个新的链表。
# Definition for 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
"""
if head == None:
return None
b = ListNode(head.val)
head = head.next
while head != None:
c = ListNode(head.val)
c.next = b
b = c
head = head.next
return b