题目:输入一个链表,反转链表后,输出新链表的表头。
python实现:
# -*- 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 pHead is None or pHead.next is None:
return pHead
pre=None
while pHead is not None:
tmp = pHead.next #当前头结点的下一个节点
pHead.next = pre #令当前头节点指向前一个结点
pre = pHead #当前头节点变为前节点
pHead = tmp #下一个节点成为新的头节点
return pre