题解 | #反转链表#
反转链表
http://www.nowcoder.com/practice/75e878df47f24fdc9dc3e400ec6058ca
# def __init__(self, x):
# self.val = x
# self.next = None
#
# 代码中的类名、方法名、参数名已经指定,请勿修改,直接返回方法规定的值即可
#
#
# @param head ListNode类
# @return ListNode类
#
class Solution:
def ReverseList(self , head: ListNode) -> ListNode:
# write code here
if head == None or head.next == None:#空节点或单节点,直接返回
return head
temp = None #用以记录前一个节点
while head != None:
temp0 = head.next#先记录下一个节点,遍历
head.next = temp #当前节点指向前一个
temp = head #前一个变成当前
head = temp0 #当前变成下一个
return temp