输入一个链表,反转链表后,输出新链表的表头。
**第一思路:**用一个列表来保存,消耗空间
# -*- coding:utf-8 -*-
# class ListNode:
# def __init__(self, x):
# self.val = x
# self.next = None
class Solution:
# 返回ListNode
def ReverseList(self, pHead):
# write code here
if not pHead:
return None
list_node = []
while pHead:
list_node.append(pHead.val)
pHead = pHead.next
list_node = list_node[::-1]
result = head = ListNode(0)
for i in list_node:
head.next = ListNode(i)
head = head.next
return result.next
拓展方法补充
用指针的方法,一个指针指向head,一个指针指向后一个节点,另一个指向前一个节点,然后通过调整指针的先后顺序,反转链表。
方法一:迭代
# 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 not head or not head.next:
return head
#迭代
cur=head
nexts=head.next
cur.next=None
while nexts:
temp=nexts.next
nexts.next=cur
cur=nexts
nexts=temp
return cur
l1 = ListNode(1)
l1.next = l11 = ListNode(2)
l11.next = l12 = ListNode(3)
l12.next = l13 = ListNode(4)
s = Solution()
num = s.reverseList(l1)
while num:
print(num.val,end="")
num = num.next
方法2: 递归
# 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 not head or not head.next:
return head
#递归
last_head = self.reverseList(head.next)
head.next.next = head
head.next = None
return last_head
l1 = ListNode(1)
l1.next = l11 = ListNode(2)
l11.next = l12 = ListNode(3)
l12.next = l13 = ListNode(4)
s = Solution()
num = s.reverseList(l1)
while num:
print(num.val,end="")
num = num.next