Package g0001_0100.s0024_swap_nodes_in_pairs

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    24 - Swap Nodes in Pairs.

    Medium

    Given a linked list, swap every two adjacent nodes and return its head. You must solve the problem without modifying the values in the list's nodes (i.e., only nodes themselves may be changed.)

    Example 1:

    Input: head = 1,2,3,4

    Output: 2,1,4,3

    Example 2:

    Input: head = []

    Output: []

    Example 3:

    Input: head = 1

    Output: 1

    Constraints:

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

    • 0 <= Node.val <= 100

    • 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 swapPairs(ListNode head)

      • Methods inherited from class java.lang.Object

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