Package g1701_1800.s1721_swapping_nodes_in_a_linked_list

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    1721 - Swapping Nodes in a Linked List.

    Medium

    You are given the head of a linked list, and an integer k.

    Return the head of the linked list after swapping the values of the <code>k<sup>th</sup></code> node from the beginning and the <code>k<sup>th</sup></code> node from the end (the list is 1-indexed ).

    Example 1:

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

    Output: 1,4,3,2,5

    Example 2:

    Input: head = 7,9,6,6,7,8,3,0,9,5, k = 5

    Output: 7,9,6,6,8,7,3,0,9,5

    Constraints:

    • The number of nodes in the list is n.

    • <code>1 <= k <= n <= 10<sup>5</sup></code>

    • 0 &lt;= Node.val &lt;= 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 swapNodes(ListNode head, Integer k)

      • Methods inherited from class java.lang.Object

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