human
Solve the following python programming problem given the following code:
# 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
        """
        prev = None
        while head is not None:
            curr = head
            head = head.next  # do not mass up the order !!!
            curr.next = prev
            prev = curr
        return prev
        
Given the above code, generate some markdown instructions for it.
assistant
#Here is the Python code you requested.

Reverse Linked List
https://leetcode.com/problems/reverse-linked-list/description/

do not mass up the order !!!