题解 | #反转链表#

# -*- 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
        p_new = None
        
        while(pHead):
            tmp = pHead.next
            pHead.next = p_new
            p_new = pHead
            pHead = tmp
        return p_new