,6,6,8,7,3,0,9,5]

Solution

Method 1 - Find the length of list

Determine Length of the List: Traverse the list to determine its total length n.
Identify k-th Nodes:
- The k-th node from the beginning is straightforward.
- The k-th node from the end is the (n - k + 1)-th node from the beginning.
Swap Values: Swap the values of the identified nodes.
Return the Modified List: Return the head of the modified linked list.

Code

[{"language":"Java","code":"class Solution {\n    public ListNode swapNodes(ListNode head, int k) {\n        // Step 1: Determine the length of the list\n        int length = 0;\n        ListNode current = head;\n        while (current != null) {\n            length++;\n            current = current.next;\n        }\n\n        // Step 2: Identify the kth node from the beginning and the end\n        ListNode kthFromBeg = head;\n        for (int i = 0; i < k - 1; i++) {\n            kthFromBeg = kthFromBeg.next;\n        }\n\n        ListNode kthFromEnd = head;\n        for (int i = 0; i < length - k; i++) {\n            kthFromEnd = kthFromEnd.next;\n        }\n\n        // Step 3: Swap the values of the kth node from the beginning and the\n        // end\n        int temp = kthFromBeg.val;\n        kthFromBeg.val = kthFromEnd.val;\n        kthFromEnd.val = temp;\n\n        // Step 4: Return the head of the modified list\n        return head;\n    }\n}","lang":"java","html":"<pre class=\"shiki shiki-themes github-light github-dark\" style=\"background-color:#fff;--shiki-dark-bg:#24292e;color:#24292e;--shiki-dark:#e1e4e8\" tabindex=\"0\"><code><span class=\"line\"><span style=\"color:#D73A49;--shiki-dark:#F97583\">class</span><span style=\"color:#6F42C1;--shiki-dark

Related Tags