题目描述:
输入一个链表,反转链表后,输出新链表的表头。
解题方案:
画清楚链表,标清楚每个指针的位置:
# -*- 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 == None:
return None
if pHead.next == None:
return pHead
tmp, last, head = pHead, pHead, pHead.next
while head:
last.next = head.next
head.next = tmp
tmp = head
head = last.next
return tmp