题目链接:https://leetcode.com/problems/reverse-linked-list/
代码
# Definition for singly-linked list.
# class ListNode(object):
# def __init__(self, x):
# self.val = x
# self.next = None
class Solution(object):
def reverseList(self, head):
"""
:type head: ListNode
:rtype: ListNode
"""
preNode,curNode=None,head
while curNode:
curNode.next,preNode,curNode=preNode,curNode,curNode.next
return preNode