# Definition for singly-linked list.
# class ListNode(object):
# def __init__(self, x):
# self.val = x
# self.next = None
# 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
"""
prev=None
while head:
cur=head
head=head.next
cur.next=prev
prev=cur
return prev
def reverseList(self, head):
"""
:type head: ListNode
:rtype: ListNode
"""
prev=None
while head:
cur=head
head=head.next
cur.next=prev
prev=cur
return prev