链表反转问题

给你一个链表，请你帮我把它反转:

话不多说，直接写代码吧

def ListNode(self,x):
	self.val = x
	self.next = None

def ReverseList(self, pHead):
	cur = pHead
	tmp = None
	newHead = None
	if pHead == None or cur.next == None:
		return pHead
	while cur:
		tmp = cur.next
		cur.next = newHead
		newHead = cur
		cur = tmp
	return newHead
		

另一种方法就是改变了原来的列表:

def ListNode(self,x):
	self.val = x
	self.next = None

def ReverseList(self, pHead):
	if pHead == None or pHead.next == None:
		return pHead
	Node = None
	while pHead:
		p = pHead
		pHead = pHead.next
		p.next = Node
		Node = p
	return Node