Reverse LinkedList – DEV Community 👩‍💻👨‍💻

August 29, 2022

class Solution(object):
    def reverseList(self, head):
        :type head: ListNode
        :rtype: ListNode
        # If head is empty or has reached the list end
        if head is None or is None:
            return head

        # Reverse the rest list
        rest = self.reverseList(

        # Put first element at the end = head = None

        # Fix the header pointer
        return rest

Enter fullscreen modeExit fullscreen mode

Source link

Comments 0

Leave a Reply

Your email address will not be published. Required fields are marked *