Package g0201_0300.s0206_reverse_linked_list

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    206 - Reverse Linked List\.

    Easy

    Given the head of a singly linked list, reverse the list, and return the reversed list.

    Example 1:

    Input: head = 1,2,3,4,5

    Output: 5,4,3,2,1

    Example 2:

    Input: head = 1,2

    Output: 2,1

    Example 3:

    Input: head = []

    Output: []

    Constraints:

    • The number of nodes in the list is the range [0, 5000].

    • -5000 <= Node.val <= 5000

    Follow up: A linked list can be reversed either iteratively or recursively. Could you implement both?

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final ListNode reverseList(ListNode head)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait